Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach

Mr. Kalli Srinivasa Nageswara Prasad
Mr. Kalli Srinivasa Nageswara Prasad * §
Contact
Prof. S.Ramakrishna
Prof. S.Ramakrishna
Contact
§ Sri Venkateswara University, Tirupati.

Send Message

To: Author

Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach

Article Fingerprint

ReserarchID

CST0B0OY

Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
Access Review Comments
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Past observations have shown that a frequent item set mining algorithm are alleged to mine the closed ones because the finish offers a compact and a whole progress set and higher potency. Anyhow, the most recent closed item set mining algorithms works with candidate maintenance combined with check paradigm that is dear in runtime likewise as area usage when support threshold is a smaller amount or the item sets gets long. Here, we show, PEPP with inference analysis that could be a capable approach used for mining closed sequences for coherent rules while not candidate. It implements a unique sequence closure checking format with inference analysis that based mostly on Sequence Graph protruding by an approach labeled “Parallel Edge projection and pruning” in brief will refer as PEPP. We describe a novel inference analysis approach to prune patterns that tends to derive coherent rules. A whole observation having sparse and dense real-life information sets proved that PEPP with inference analysis performs larger compared to older algorithms because it takes low memory and is quicker than any algorithms those cited in literature frequently.

References

37 Cites in Article
  1. F Masseglia,F Cathala,P Poncelet (1995). The psp approach for mining sequential patterns.
  2. R Srikant,R (1996). Mining sequential patterns: Generalizations and performance improvements.
  3. J Han,J Pei,B Mortazavi-Asl,Q Chen,U Dayal,M Hsu (2000). FreeSpan: Frequent patternprojected sequential pattern mining.
  4. M Zaki (2001). SPADE: An Efficient Algorithm for Mining Frequent Sequences.
  5. J Pei,J Han,B Mortazavi-Asl,Q Chen,U Dayal,M Hsu (2001). Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth.
  6. Jay Ayres,Jason Flannick,Johannes Gehrke,Tomi Yiu (2002). Sequential PAttern mining using a bitmap representation.
  7. M Garofalakis,R Rastogi,K Shim (1999). Mining sequential patterns with regular expression constraints.
  8. J Pei,J Han,W Wang (2002). Constraint-based sequential pattern mining in large databases.
  9. Masakazu Seno,George Karypis (2002). SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint.
  10. H Mannila,H Toivonen,A Verkamo (1995). Discovering frequent episodes in sequences.
  11. B Ozden,S Ramaswamy,A Silberschatz (1998). Cyclic association rules.
  12. C Bettini,X Wang,S Jajodia (1998). Mining temporal relationals with multiple granularities in time sequences.
  13. J Han,G Dong,Y Yin (1999). Efficient mining of partial periodic patterns in time series database.
  14. J Yang,P Yu,W Wang,J Han (2002). Mining long sequential patterns in a noisy environment.
  15. Nicolas Pasquier,Yves Bastide,Rafik Taouil,Lotfi Lakhal (1999). Discovering Frequent Closed Itemsets for Association Rules.
  16. Mohammed Zaki,Ching-Jui Hsiao (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining.
  17. J Yan,R Han,Afshar (2003). CloSpan: Mining Closed Sequential Patterns in Large Databases.
  18. Jianyong Wang,Jiawei Han,Jian Pei (2003). CLOSET+.
  19. Rakesh Agrawal,Ramakrishnan Srikant (1994). Whither Data Mining?.
  20. J Pei,J Han,R Mao (2001). CLOSET: An efficient algorithm for mining frequent closed itemsets.
  21. J Han,J Wang,Y Lu,P Tzvetkov (2002). Mining Top-K Frequent Closed Patterns without Minimum Support.
  22. P Aloy,E Querol,F Aviles,M Sternberg (2002). Automated Structure-based Prediction of Functional Sites in Proteins: Applications to Assessing the Validity of Inheriting Protein Function From Homology in Genome Annotation and to Protein Docking.
  23. R Agrawal,R Srikant (1995). Mining sequential patterns.
  24. Inge Jonassen,John Collins,Desmond Higgins (1995). Finding flexible patterns in unaligned protein sequences.
  25. R Kohavi,C Brodley,B Frasca,L Mason,Z Zheng (2000). KDD-cup 2000 organizers' report: Peeling the Onion.
  26. Jianyong Wang,Jiawei Han BIDE: Efficient Mining of Frequent Closed Sequences.
  27. Kalli Srinivasa,Nageswara Prasad,Prof Ramakrishna (2011). Article: Frequent Pattern Mining and Current State of the Art.
  28. Rakesh Agrawal,Tomasz Imieliński,Arun Swami (1993). Mining association rules between sets of items in large databases.
  29. U Fayyad,G Piatetsky-Shapiro,P Smyth,R Uthurusamy (1996). Advances in Knowledge Discovery and Data Mining.
  30. A Silberschatz,A Tuzhilin (1996). What makes patterns interesting in knowledge discovery systems.
  31. Mohammed Zaki,Srinivasan Parthasarathy,Mitsunori Ogihara,Wei Li (1998). Parallel Algorithms for Discovery of Association Rules.
  32. D Burdick,M Calimlim,J Flannick,J Gehrke,T Yiu (2005). Mafia: A Maximal Frequent Itemset Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach.
  33. J Li (2006). On Optimal Rule Discovery.
  34. M Zaki (2000). Generating Non-Redundant Association Rules.
  35. N Pasquier,Y Bastide,R Taouil,L Lakhal (1999). Efficient Mining of Association Rules Using Closed Itemset Lattices.
  36. H Toivonen,M Klemettinen,P Ronkainen,K Hatonen,H Mannila (1995). Pruning and Grouping of Discovered Association Rules.
  37. B Baesens,S Viaene,J Vanthienen (2000). Post-Processing of Association Rules.
Show All References
Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Mr. Kalli Srinivasa Nageswara Prasad, Prof. S.Ramakrishna. 1970. "Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach". Global Journal of Computer Science and Technology GJCST Volume 11 (GJCST Volume 11 Issue 19).

More Citation Formats

Download Citation

  • Open Access
  • CC-BY-ND-NC 4.0
Download Article
Access OJS
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Association Rule MiningClosed itemsetData miningFrequent ItemsetKDDPEPP
Classification
GJCST Classification H.2.8
  • Submission ReceivedSeptember 1, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted September 24, 2011
  • Published October 6, 2011
Version of record

v1.2

Issue date
November 11, 2011

Language
English
Order Article Reprint
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR
Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D
Article Matrices
Total Views: 8.1K
Total Downloads: 394
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Mining Closed Itemsets for Coherent Rules: An Inference Analysis Approach

Mr. Prasad
Mr. Prasad Sri Venkateswara University, Tirupati.
Prof. S.Ramakrishna
Prof. S.Ramakrishna
  • Submission ReceivedSeptember 1, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted September 24, 2011
  • Published October 6, 2011