1 January 2017 in International Journal of Rough Sets and Data Analysis
This paper introduces a new approach of clustering of text documents based on a set of words using graph mining techniques. The proposed approach clusters (groups) those text documents having searched successfully for the given set of words from a set of given text documents. The document-word relation can be represented as a bi-partite graph. All the clustering of text documents is represented as sub-graphs. Further, the paper proposes an algorithm for clustering of text documents for a given set of words. It is an automated system and requires minimal human interaction for the clustering of text documents. The algorithm has been implemented using C++ programming language and observed satisfactory results.
1 January 2015 in Procedia Computer Science
Community detection is the one of the most relevant and important topics in the field of graph mining, principally for its applications in number of domains such as social or biological networks analysis to transport systems. Different community detection algorithms have been proposed earlier. This paper discusses and proposes a new technique on particular community detection and its retrieval in social community graph. Community detection constitutes a significant role for analysis of a large community graph by enabling and selecting the desired community's graph. It tries to extract a sub-community graph from a very large community graph for analysis. This paper presents both a theoretical and experimental result in this direction with certain example. We have retrieved the sub-community graph from a compressed community graph in the context of graph mining techniques. Observation concludes that the proposed technique is simpler, easier and efficient in terms of complexities