Abstract | ||
---|---|---|
Discovering structures in streaming data is an important data mining task and has motivated design of several well known algorithms. However, in some applications, a higher level of analysis is desirable to reveal the set of dimensions which contribute heavily to the structures.In this paper, we propose an algorithm ISID (Identifying Structures with Informative Dimensions), which operates in the streaming environment and delivers clusteres along with dimensions that contribute significantly to these clusters. The algorithm uses a three stage approach andutilizes entropy in an innovative way to achieve the goal in four different ways, depending on the desired guarantees on structural richness or minimal dimension set for a cluster.The experimental results on synthetic and real data sets demonstrate the efficiency and effectiveness of the proposed algorithm. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/ICIS.2009.95 | ACIS-ICIS |
Keywords | Field | DocType |
higher level,different way,discovering structure,informative dimensions,identifying structures,important data mining task,algorithm isid,proposed algorithm,telephony,clustering,data structure,application software,computer science,entropy,information science,uncertainty,data mining,merging,memory management,algorithm design and analysis,data structures,data streams,statistical distributions,data clustering,clustering algorithms | Data mining,Cluster (physics),Data structure,Data set,Data stream mining,Algorithm design,Computer science,Memory management,Cluster analysis,Level of analysis | Conference |
Citations | PageRank | References |
1 | 0.37 | 13 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vasudha Bhatnagar | 1 | 181 | 17.69 |
Sharanjit Kaur | 2 | 27 | 4.48 |
Neelima Gupta | 3 | 159 | 19.69 |