A FREQUENT DOCUMENT MINING ALGORITHM WITH CLUSTERING
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 5
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.
Authors and Affiliations
Mr. Rakesh Kumar Soni , Prof. Neetesh Gupta , Prof. Amit Sinhal
Keywords
Related Articles
- EP ID EP119837
- DOI -
- Views 132
- Downloads 0
LOW POWER NOVEL HYBRID ADDERS FOR DATAPATH CIRCUITS IN DSP PROCESSOR
A majority of the portable multimedia embedded devices like mobile phone, notebook computers which interfaces with information from the real-world environment are essentially Digital Signal Processing (DSP) circuits whos...
A TRAILBLAZING MODUS OPERANDI TO FACE IDENTIFICATION USING A RECKONING ARCHETYPAL PRINCIPAL COMPONENT ANALYSIS
Face identification is a task of designating human faces with exact names, akin to identifying between similar twins. The work was motivated and is imbibed by physiology and information theory domains. The approach treat...
An Efficient Algorithm for Image Enhancement
In the digital image processing field enhancement and removing the noise in the image is a critical issue. We have proposed a new algorithm to enhance color Image corrupted by Gaussian noise using fuzzy logic which descr...
OPTIMAL IMPLEMENTATION METHODS FOR AUDIO CROSSTALK CANCELLATION ON DSP PROCESSORS
In general, frequency domain based techniques are preferred to time domain techniques for the implementation of audio crosstalk cancellation due to time domain techniques suffer from more computations. In this paper, the...
PERFORMANCE ANALYSIS OF SOFT COMPUTING TECHNIQUES FOR CLASSIFYING CARDIAC ARRHYTHMIA
Cardiovascular diseases kill more people than other diseases. Arrhythmia is a common term used for cardiac rhythm deviating from normal sinus rhythm. Many heart diseases are detected through electrocardiograms (ECG) anal...