skip to main content
10.1145/3242840.3242872acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicacsConference Proceedingsconference-collections
research-article

A Label Propagation Algorithm Based on Local Density of Data Points

Published: 27 July 2018 Publication History

Abstract

Cluster analysis is one of the hot issues in the field of data mining and it has extensive applications in many aspects. The label propagation algorithm is easy to implement. At the same time, it has a low time complexity which has been recognized by scholars. Because the algorithm needs to specify the category labels of the data set, the accuracy and adaptability of the algorithm are affected. In view of the above problems, this paper proposes a new clustering algorithm that combines the advantages of density-based and label propagation. The algorithm adaptively determines the label of the data points through local density and reducing the effect of noise on the results. Experimental results show that the proposed algorithm has better adaptability while improving the accuracy of clustering results.

References

[1]
Zhou Weixing, Liao Huan. Image Region Segmentation Based on K-Means Clustering and Probabilistic Relaxation{J}. Computer Technology and Development, 2010, 20(2):68 -70.
[2]
Nisha, Kaur P J. Cluster quality based performance evaluation of hierarchical clustering method{C}// International Conference on Next Generation Computing Technologies. IEEE, 2016:649--653.
[3]
R.Yogita, Dr.R.Harish, A Study of Hierarchical Clustering Algorithm, International Journal of Information and Computation Technology, vol.3, p. 1225--1232, Nov 2013.
[4]
Zhang T, Ramakrishnan R, Livny M. BIRCH: an efficient data clustering method for very large databases{C}// ACM SIGMOD International Conference on Management of Data. ACM, 1996:103--114.
[5]
Macqueen J. Some Methods for Classification and Analysis of MultiVariate Observations{C}// Proc. of, Berkeley Symposium on Mathematical Statistics and Probability. 1967:281--297.
[6]
NEster M, Kriegel H P, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise{C}// International Conference on Knowledge Discovery and Data Mining. AAAI Press, 1996:226--231.
[7]
Patwary M M A, Satish N, Sundaram N, et al. Pardicle: Parallel Approximate Density-Based Clustering{C}// High Performance Computing, Networking, Storage and Analysis, SC14: International Conference for. IEEE, 2014:560--571.
[8]
Wang W, Yang J, Muntz R R. STING: A Statistical Information Grid Approach to Spatial Data Mining{C}// International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc. 1997:186--195.
[9]
Chen Xinquan, Zhou Lingjing, Liu Yaozhong. A Survey of Clustering Algorithms{J}. Integrated Technology, 2017(3):41--49.
[10]
Fisher D. Improving inference through conceptual clustering{C}// National Conference on Artificial Intelligence. Seattle, Wa, July. DBLP, 1987:461--465.
[11]
Zhu X, Ghahramani Z. Learning from labeled and unlabeled data with label propagation{R}. Technical Report CMU-CALD-02--107{R}.Pittsburghers:Carnegie Mellon University, 2002.
[12]
Zhang Junli, Chang Yanli, Shi Wen. A Survey of Tag Propagation Algorithm Theory and Its Application{J}. Journal of Computer Applications, 2013, 30(1):21--25.
[13]
Strehl A, Ghosh J. Cluster ensembles: a knowledge reuse framework for combining partitionings{C}// Eighteenth national conference on Artificial intelligence. American Association for Artificial Intelligence, 2002:93--98.
[14]
C.J.Veenman, M.J.T.Reinders, and E. Backer, A maximum variance cluster algorithm. IEEE Trans. Pattern Analysis and Machine Intelligence, 2002. 24(9): p. 1273--1280.
[15]
A. Gionis, H.Mannila, and P.Tsaparas, Clustering aggregation. ACM Transactions on Knowledge Discovery from Data (TKDD), 2007. 1(1): p. 1--30.
[16]
L. Fu and E. Medico, FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data. BMC bioinformatics, 2007. 8(1): p. 3.

Index Terms

  1. A Label Propagation Algorithm Based on Local Density of Data Points

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICACS '18: Proceedings of the 2nd International Conference on Algorithms, Computing and Systems
    July 2018
    245 pages
    ISBN:9781450365093
    DOI:10.1145/3242840
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    • Xi'an Jiaotong-Liverpool University: Xi'an Jiaotong-Liverpool University

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 27 July 2018

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Label propagation
    2. cluster analysis
    3. data mining
    4. local density

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICACS '18

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 39
      Total Downloads
    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media