Priority Based New Approach for Correlation Clustering
Автор: Aaditya Jain, Suchita Tyagi
Журнал: International Journal of Information Technology and Computer Science(IJITCS) @ijitcs
Статья в выпуске: 3 Vol. 9, 2017 года.
Бесплатный доступ
Emerging source of Information like social network, bibliographic data and interaction network of proteins have complex relation among data objects and need to be processed in different manner than traditional data analysis. Correlation clustering is one such new style of viewing data and analyzing it to detect patterns and clusters. Being a new field, it has lot of scope for research. This paper discusses a method to solve problem of chromatic correlation clustering where data objects as nodes of a graph are connected through color-labeled edges representing relations among objects. Purposed heuristic performs better than the previous works.
Clustering Problems, Correlation Clustering, Chromatic Balls, and Priority Based Chromatic Balls
Короткий адрес: https://sciup.org/15012630
IDR: 15012630
Список литературы Priority Based New Approach for Correlation Clustering
- E.W. Forgy, "Cluster Analysis of Multivariate Data: Efficiency v/s Interpretability of Classification", Biometrics, 21, 768-769, 1965.
- J. C. Bezdek , R. Ehrlich and W. Full, "FCM: The Fuzzy C-Means Clustering Algorithm" , Computers & Geosciences, vol. 10, No. 2-3, pp. 191 -203, 1984.
- N. Bansal, A. Blum and S. Chawla, "Correlation Clustering ", Machine Learning, Vol. 56, Pp. 89-113, 2004.
- F. Bonchi, A Gionis , F. Gullo and Ukkonen, " Chromatic Correlation Clustering ", Proceedings of The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'12) ,pp. 1321-1329,2012.
- F. Bonchi, A. Gionis, F. Gullo Charalampos, E. Tsourakakis And A. Ukkonen,"Chromatic Correction Clustering", ACM Transactions on Knowledge Discovery from Data (TKDD),Vol.9 Issue 4 ,No. 34, 2015.
- Aaditya Jain, Dr. Bala Buksh, “Advancement in Clustering with the Concept of Correlation Clustering-A Survey”, International Journal of Engineering Development and Research, Vol. 4, Issue 2, 2016.
- M. Rice and V. J. Tsotras, “Graph indexing of road networks for shortest path queries with label restrictions”, Proceedings of the VLDB Endowment, Vol. 4, No. 2, pp. 69-80, 2010.
- M. J. Kearns, R. E. Schapire, and L. M. Sellie, "Toward Efficient Agnostic Learning ", Machine Learning , Vol. 17, No. 2-3, pp. 115-142, 1994.
- I. Giotis and V. Guruswami, “Correlation Clustering with a Fixed Number of Clusters”, Theory Of Computing, Vol. 2, pp. 249–266, 2006.
- N. Ailon and E. Liberty, “Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems”, Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I (ICALP '09), pp. 24-36, 2009.
- Yi Gu and Chaoli Wang, “A Study of Hierarchical Correlation Clustering for Scientific Volume Data”, Advances in Visual Computing, Volume 6455 of the series Lecture Notes in Computer Science, pp 437-446, 2010.
- K. Makarychev, Y. Makarychev and A. Vijayaraghavan, “Correlation Clustering with Noisy Partial Information” in JMLR: Workshop and Conference Proceedings, vol 40, pp.1–22, 2015.
- Kookjin Ahn, Graham Cormode, Sudipto Guha, Andrew Mcgregor and Anthony Wirth, “Correlation Clustering in Data Streams” in Proceedings of the 32nd International Conference on Machine Learning (ICML-15), pp:2237-2246, 2015.
