Affinity learning for mixed data clustering
Pages 2173 - 2179
Abstract
In this paper, we propose a novel affinity learning based framework for mixed data clustering, which includes: how to process data with mixed-type attributes, how to learn affinities between data points, and how to exploit the learned affinities for clustering. In the proposed framework, each original data attribute is represented with several abstract objects defined according to the specific data type and values. Each attribute value is transformed into the initial affinities between the data point and the abstract objects of attribute. We refine these affinities and infer the unknown affinities between data points by taking into account the interconnections among the attribute values of all data points. The inferred affinities between data points can be exploited for clustering. Alternatively, the refined affinities between data points and the abstract objects of attributes can be transformed into new data features for clustering. Experimental results on many real world data sets demonstrate that the proposed framework is effective for mixed data clustering.
References
[1]
Amir Ahmad and Lipika Dey. A k-mean clustering algorithm for mixed numeric and categorical data. Data & Knowledge Engineering , 63(2):503-527, 2007.
[2]
Christian Böhm, Sebastian Goebl, Annahita Oswald, Claudia Plant, Michael Plavinski, and Bianca Wackersreuther. Integrative parameter-free clustering of data with mixed type attributes. In Pacific-Asia Conference on Knowledge Discovery and Data Mining , pages 38-47. Springer, 2010.
[3]
John C Gower. A general coefficient of similarity and some of its properties. Biometrics , pages 857- 871, 1971.
[4]
Chung-Chian Hsu and Yu-Cheng Chen. Mining of mixed data with application to catalog marketing. Expert Systems with Applications , 32(1):12- 23, 2007.
[5]
Chung-Chian Hsu and Yan-Ping Huang. Incremental clustering of mixed data based on distance hierarchy. Expert Systems with Applications , 35(3):1177-1185, 2008.
[6]
Zhexue Huang. Clustering large data sets with mixed numeric and categorical values. In Proceedings of the 1st pacific-asia conference on knowledge discovery and data mining, (PAKDD) , pages 21-34. Citeseer, 1997.
[7]
Zhexue Huang. Extensions to the k-means algorithm for clustering large data sets with categorical values. Data mining and knowledge discovery , 2(3):283-304, 1998.
[8]
Liping Jing, Michael K Ng, and Joshua Zhexue Huang. An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Transactions on Knowledge and Data Engineering , 19(8):1026-1041, 2007.
[9]
Jaz Kandola, Nello Cristianini, and John S Shawe-taylor. Learning semantic similarity. In Advances in Neural Information Processing Systems , pages 673-680, 2003.
[10]
Pierre Legendre and Louis Legendre. Numerical ecology, volume 24, (developments in environmental modelling). 1998.
[11]
Nan Li and Longin Jan Latecki. Affinity inference with application to recommender systems. In Web Intelligence and Intelligent Agent Technology (WI-IAT), 2015 IEEE/WIC/ACM International Conference on , volume 1, pages 393-400. IEEE, 2015.
[12]
Claudia Plant and Christian Böhm. Inconco: interpretable clustering of numerical and categorical objects. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages 1127-1135. ACM, 2011.
[13]
Claudia Plant. Dependency clustering across measurement scales. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining , pages 361-369. ACM, 2012.
[14]
János Podani. Extending gower's general coefficient of similarity to ordinal characters. Taxon , pages 331-340, 1999.
[15]
Xingwei Yang, Lakshman Prasad, and Longin Jan Latecki. Affinity learning with diffusion on tensor product graph. IEEE transactions on pattern analysis and machine intelligence , 35(1):28-38, 2013.
[16]
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf. Learning with local and global consistency. In NIPS , volume 16, pages 321-328, 2003.
- Affinity learning for mixed data clustering
Recommendations
Initializing K-means Clustering Using Affinity Propagation
HIS '09: Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 01K-means clustering is widely used due to its fast convergence, but it is sensitive to the initial condition.Therefore, many methods of initializing K-means clustering have been proposed in the literatures. Compared with Kmeans clustering, a novel ...
Subspace clustering using affinity propagation
This paper proposes a subspace clustering algorithm by introducing attribute weights in the affinity propagation algorithm. A new step is introduced to the affinity propagation process to iteratively update the attribute weights based on the current ...
Robust Speaker Clustering Using Affinity Propagation
In this letter, a recently proposed clustering algorithm named affinity propagation is introduced for the task of speaker clustering. This novel algorithm exhibits fast execution speed and finds clusters with low error. However, experiments show that ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- Australian Comp Soc: Australian Computer Society
- NSF: National Science Foundation
- Griffith University
- University of Technology Sydney
- AI Journal: AI Journal
Publisher
AAAI Press
Publication History
Published: 19 August 2017
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024