全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

A FREQUENT DOCUMENT MINING ALGORITHM WITH CLUSTERING

Keywords: clustering , document-graph , FP-growth , graph mining , frequent sub graphs clustering.

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133