e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers

Aug 2019 - Volume 10, Issue 4
Deadline: 15 Jul 2019
Notification: 15 Aug 2019
Publication: 31 Aug 2019

Oct 2019 - Volume 10, Issue 5
Deadline: 15 Sep 2019
Notification: 15 Oct 2019
Publication: 30 Oct 2019

Indexed in

IJCSE Indexed in Scopus

ABSTRACT

Title : A FREQUENT DOCUMENT MINING ALGORITHM WITH CLUSTERING
Authors : Mr. Rakesh Kumar Soni, Prof. Neetesh Gupta, Prof. Amit Sinhal
Keywords : clustering, document-graph, FP-growth, graph mining, frequent sub graphs clustering.
Issue Date : Oct-Nov 2012
Abstract :
Now days, finding the association rule from large number of item-set become very popular issue in the field of data mining. To determine the association rule researchers implemented a lot of algorithms and techniques. FPGrowth is a very fast algorithm for finding frequent item-set. This paper, give us a new idea in this field. It replaces the role of frequent item-set to frequent sub graph discovery. It uses the processing of datasets and describes modified FP-algorithm for sub-graph discovery. The document clustering is required for this work. It can use self-similarity function between pair of document graph that similarity can use for clustering with the help of affinity propagation and efficiency of algorithm can be measure by F-measure function.
Page(s) : 678-686
ISSN : 0976-5166
Source : Vol. 3, No.5