Open AccessJournal Article
Modified Structural and Attribute Clustering Algorithm for Improving Cluster Quality in Data Mining: A Quality Oriented Approach
2
TL;DR: The existing Structural and Attribute cluster algorithm is analyzed and a new algorithm is proposed and it is found that the modified algorithm gives better quality clusters.
read more
Abstract: The need of Data mining is because of the explosive growth of data from terabytes to petabytes. Data mining preprocess aims to produce the quality mining result in descriptive and predictive analysis. The quality of a clustering result depends on both the similarity measure used by the method and its implementation. A straightforward way to combine structural and attribute similarities is to use a weighted distance function. Clustering results are arrived based on attribute similarities. The clusters balance the attribute and structural similarities. The existing Structural and Attribute cluster algorithm is analyzed and a new algorithm is proposed. Both the algorithms are compared and results are analyzed. It is found that the modified algorithm gives better quality clusters.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Clustering using Cuckoo search levy flight
Aishwarya Palaiah,Akshata H Prabhu,Reetika Agrawal,S. Natarajan +3 more
- 01 Sep 2016
TL;DR: A Cuckoo Search based on Levy Flight (CSFL) algorithm is proposed in this article for web document clustering. And Levy Flight helps us to speed up the local search which also ensures that it covers output domain efficiently.
8
Clustering using Cuckoo search levy flight
Palaiah Aishwarya,Prabhu Akshata H,Agrawal Reetika,S Natarajan +3 more
- 01 Jan 2016
TL;DR: The obtained result shows that good performance can be achieved when Cuckoo Search based on Levy Flight algorithm is used for clustering of web documents.
References
•Book
Data Mining: Concepts and Techniques
Jiawei Han,Micheline Kamber,Jian Pei +2 more
- 08 Sep 2000
TL;DR: This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data.
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
Alexander Strehl,Joydeep Ghosh +1 more
TL;DR: This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings and proposes three effective and efficient techniques for obtaining high-quality combiners (consensus functions).
Computing communities in large networks using random walks
Pascal Pons,Matthieu Latapy +1 more
- 26 Oct 2005
TL;DR: In this article, a measure of similarities between vertices based on random walks is proposed, which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, it works at various scales.
Computing communities in large networks using random walks.
Pascal Pons,Matthieu Latapy +1 more
TL;DR: A measure of similarities between vertices based on random walks which captures well the community structure in a network, can be computed efficiently, and it can be used in an agglomerative algorithm to compute efficiently thecommunity structure of a network.
1.3K
Graph clustering based on structural/attribute similarities
Yang Zhou,Hong Cheng,Jeffrey Xu Yu +2 more
- 01 Aug 2009
TL;DR: This paper proposes a novel graph clustering algorithm, SA-Cluster, based on both structural and attribute similarities through a unified distance measure, which partitions a large graph associated with attributes into k clusters so that each cluster contains a densely connected subgraph with homogeneous attribute values.