Covering Rough Clustering Approach for Unstructured Activity Analysis

Covering Rough Clustering Approach for Unstructured Activity Analysis

Prabhavathy Panneer (School of Information Technology and Engineering, VIT University, Vellore, India) and B.K. Tripathy (School of Computing Science and Engineering, VIT University, Vellore, India)
Copyright: © 2016 |Pages: 11
DOI: 10.4018/IJIIT.2016040101


Several tasks under human activities need to be performed in a sequence of navigation and manipulation of objects. In several applications of human activities like robotics monitoring plays an important role. So, in these applications, processing of sequential data is of utmost importance. Because of the presence of imprecision intelligent clustering approaches using fuzzy or rough set techniques play a major role. The basic rough sets which are defined by using equivalence relations is less useful because of their scarcity in real life scenarios. As a result, covering based rough sets have been introduced which are more general and applicable to real world problems. In this paper, covering rough set based clustering approach is introduced and studied using refined first type of covering based rough sets. Through experimental analysis,illustrated the efficiency of proposed algorithm and provided a comparative analysis of this algorithm with other existing algorithms.
Article Preview

Data are generated and collected using sensors, cameras and smart devices. The generated data create vagueness, incompleteness, and granularity in an information system which gives unreliable solution in the data analysis. In our day to day approach, several traditional tools are used for formal modeling, computing and reasoning of data, which are basically crisp and deterministic in nature. Real situations are very often not crisp and deterministic, and they cannot be described precisely. Rough Sets is one of the excellent modeling tool introduced by Pawlak (Pawlak, Z.,1982,1991) which is used to study the imprecise data in the information system. Applying rough sets in real-time information systems leads to some restriction because of the equivalence relation unless the clustering of problem appears to hold true for equivalence relation.The equivalence relations of rough sets were extended to generalized binary relations in several directions. Similarly, partitions of the universes used to define rough sets were extended to coverings. A type of generalized rough sets based on covering and the relationship between this type of covering- based rough sets (Zhanhong Shi & Zengtai Gong, 2010) and the generalized rough sets based on binary relation were studied. Clusters can be hard or soft in nature. In soft clustering, an object may be a member of two or more clusters. Soft clusters may have fuzzy or rough boundaries. Web mining is one such area where overlapping clusters are required. Generally, clustering algorithms make use of either distance functions or similarity functions for comparing pairs of sequences.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 15: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing