Search

Semi-Supervised Graph Clustering (SSGC) has emerged as a pivotal field at the intersection of graph clustering and semi-supervised learning (SSL), offering innovative solutions to intricate data analysis problems. However, despite its significance and wide-ranging applications, there exists a notable void in the literature—a comprehensive survey specifically dedicated to SSGC techniques and their diverse applications remains conspicuously absent. Addressing this gap, this paper presents a systematic and comprehensive review of SSGC methodologies, spanning from well-established approaches to cutting-edge developments. Through a meticulous categorization, critical examination, and insightful discussion of these techniques, this survey not only illuminates the current landscape of SSGC but also identifies unexplored avenues for exploration and innovation. In this paper we present a comprehensive survey of conventional graph construction, graph clustering, SSL methods, evaluation metrics and their primary development process. We then provide a taxonomy of SSGC techniques based on their structures and principles and thoroughly analyze and discuss the related models. Furthermore, we review the applications of SSGC in various fields. Lastly, we summarize the limitations of current SSGC algorithms and discuss the future directions of the field. [ABSTRACT FROM AUTHOR]

Semi-Supervised Graph Clustering (SSGC) has emerged as a pivotal field at the intersection of graph clustering and semi-supervised learning (SSL), offering innovative solutions to intricate data analysis problems. However, despite its significance and wide-ranging applications, there exists a notable void in the literature—a comprehensive survey specifically dedicated to SSGC techniques and their diverse applications remains conspicuously absent. Addressing this gap, this paper presents a systematic and comprehensive review of SSGC methodologies, spanning from well-established approaches to cutting-edge developments. Through a meticulous categorization, critical examination, and insightful discussion of these techniques, this survey not only illuminates the current landscape of SSGC but also identifies unexplored avenues for exploration and innovation. In this paper we present a comprehensive survey of conventional graph construction, graph clustering, SSL methods, evaluation metrics and their primary development process. We then provide a taxonomy of SSGC techniques based on their structures and principles and thoroughly analyze and discuss the related models. Furthermore, we review the applications of SSGC in various fields. Lastly, we summarize the limitations of current SSGC algorithms and discuss the future directions of the field. [ABSTRACT FROM AUTHOR]

MapReduce is a popular paradigm in distributed computing, but it is not efficient when executing iterative algorithms over a distributed big dataset due to its heavy data communication overhead. Non-MapReduce computing is an alternative for improving computing efficiency and data scalability when using iterative algorithms to process big distributed datasets on clusters. In this paper, we investigate Non-MapReduce approach in distributed computing and use Spark implementations of machine learning algorithms to discuss the problems of MapReduce in executing iterative algorithms over a big distributed dataset and the advantages of Non-MapReduce for the same tasks. We present a method to build a new machine learning library made of sequential algorithms for distributed computing. We use experiment results to show comparisons of computing efficiency and data scalability of MapReduce and Non-MapReduce in executing six machine learning algorithms over big datasets. [ABSTRACT FROM AUTHOR]

Computational tools for the analysis of data gathered by monitoring systems are necessary because the amount of data steadily increases. Machine learning algorithms can be used in both regression and classification problems, providing useful insights while avoiding the bias and proneness to errors of humans. In this paper, a specific kind of decision tree algorithm, called conditional inference tree, is used to extract relevant knowledge from data that pertains to electrical motors. The model is chosen due to its flexibility, strong statistical foundation, as well as great capabilities to generalize and cope with problems in the data. The obtained knowledge is organized in a structured way and then analyzed in the context of health condition monitoring. The final results illustrate how the approach can be used to gain insight into the system and present the results in an understandable, user-friendly manner. [ABSTRACT FROM AUTHOR]

Due to the rapidly growing volume and velocity of big data, real-time streaming data analysis has become increasingly important in many applications. To discover knowledge from such data, a wide range of machine learning techniques have been proposed and used in practice. Among them, clustering, which aims at grouping objects into different classes on the basis of their similarity, is the most common form of unsupervised learning. However, most existing clustering algorithms are designed for static data, and hence are not best suited for streaming data. In this paper, we propose PC-DPC, a two-stage progressive clustering algorithm with graph-augmented density peak clustering. PC-DPC first identifies clusters of streaming data using an improved density peak clustering algorithm, and then merges newly arriving data into the existing data pool by measuring inter-cluster structural similarity, which considers the distance between a center and representative points. We illustrate the superiority of PC-DPC over several state-of-the-art clustering algorithms in terms of clustering accuracy and running time on publicly available benchmark datasets. [ABSTRACT FROM AUTHOR]