­
­
­
­

Inventi Rapid - Software Engineering

Articles

  • Inventi:ese/20132/16
    INFREQUENT WEIGHTED ITEMSET MINING USING DECISION TREE AND FREQUENT PATTERN GROWTH
    A S Dange , Snehal J Patil*

    The frequent item set mining is one of the popular data mining techniques and it can be used in many data mining fields for finding highly correlated item sets. An infrequent item set mining finds rarely occurring item sets in the database. The proposed system uses clustering or logical grouping concepts for finding infrequent weighted item sets. The algorithm which is used in the proposed system, works well with real-time databases and is highly scalable which is suited for real-time applications. Incessant weighted item sets to associate frequently holding information in which item sets may weight distinctively. The paper handles the issue of running across an extraordinary and weighted itemsets, i.e., An Infrequent Weighted Item set (IWI) mining. In this paper two novel quality measures are proposed to test the IWI (Infrequent Weighted Itemset) mining procedure. The two calculations that perform IWI and Neglectable IWI mining efficiently, which is determined by the proposed measures, are displayed. Test outcomes show the efficiency and adequacy of the proposed methodology.

    How to Cite this Article
    A S Dange, Snehal J Patil. Infrequent Weighted Itemset Mining Using Decision Tree and Frequent Pattern Growth. Inventi Rapid: Software Engineering, 2016(4):1-5, 2016.
    Download Full Text