Agent-Based Subspace Clustering

Publication Type:
Conference Proceeding
Advances in Knowledge Discovery and Data Mining - 15th Pacific-Asia Conference, 2011, pp. 370 - 381
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010005230OK.pdf752.32 kB
Adobe PDF
This paper presents an agent-based algorithm for discovering subspace clusters in high dimensional data. Each data object is represented by an agent, and the agents move from one local environment to another to find optimal clusters in subspaces. Heuristic rules and objective functions are defined to guide the movements of agents, so that similar agents(data objects) go to one group. The experimental results show that our proposed agent-based subspace clustering algorithm performs better than existing subspace clustering methods on both F1 measure and Entropy. The running time of our algorithm is scalable with the size and dimensionality of data. Furthermore, an application in stock market surveillance demonstrates its effectiveness in real world applications.
Please use this identifier to cite or link to this item: