Attribute Relational Analysis (ARA) for Coherent Association Rules: A post mining process for Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset

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

Send Message

To: Author

Attribute Relational Analysis (ARA) for Coherent Association Rules: A post mining process for Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset

Article Fingerprint

ReserarchID

REPO3U2

Attribute Relational Analysis (ARA) for Coherent Association Rules: A post mining process for Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset 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

Abstract

Association rules present one of the most impressive techniques for the analysis of attribute associations in a given dataset related to applications related to retail, bioinformatics, and sociology. In the area of data mining, the importance of the rule management in associating rule mining is rapidly growing. Usually, If datasets are large, the induced rules are large in volume. The density of the rule volume leads to the obtained knowledge hard to be understood and analyze. One better way of minimizing the rule set size is eliminating redundant rules from rule base. Many efforts have been made and various competent and excellent algorithms have been proposed. But all of these models relying either on closed itemset mining or expert’s evaluation. None of these models are proven best in all data set contexts. Closed itemset model is missing adaptability and expert’s evaluation process is resulting different significance for same rule under different expert’s view. To overcome these limits here we proposed a post mining process called ARA as an extension to our earlier proposed closed itemset mining algorithm called PEPP.

References

35 Cites in Article
  1. S Fienberg,G Shmueli (2005). Statistical issues and challenges associated with rapid detection of bioterrorist attacks.
  2. Pedro Carmona-Saez,Monica Chagoyen,Andres Rodriguez,Oswaldo Trelles,Jose Carazo,Alberto Pascual-Montano (2006). Integrated analysis of gene expression by association rules discovery.
  3. Ronaldo Cristiano,Prati (2009). QROC: A Variation of ROC Space to Analyze Item Set Costs/Benefits in Association Rules.
  4. P Mcnicholas (2007). Association rule analysis of CAO data (with discussion).
  5. R Prati,P Flach (2005). ROCCER: an algorithm for rule learning based on ROC analysis.
  6. Tom Fawcett (2008). PRIE: a system for generating rulelists to maximize ROC performance.
  7. Hiroyuki Kawano,Minoru Kawahara (2002). Extended Association Algorithm Based on ROC Analysis for Visual Information Navigator.
  8. G Piatetsky-Shapiro,G Piatetsky-Shapiro,W Frawley,S Brin,R Motwani,J Ullman (2005). Discovery, Analysis, and Presentation of Strong Rules.
  9. B Liu,W Hsu,Y Ma (1999). Pruning and summarizing the discovered associations.
  10. Hacene Cherfi,Amedeo Napoli,Yannick Toussaint (2009). A Conformity Measure Using Background Knowledge for Association Rules: Application to Text Mining.
  11. B Liu,W Hsu,Y Ma (1999). Pruning and summarizing the discovered associations.
  12. Hetal Thakkar,Barzan Mozafari,Carlo Zaniolo (2009). Continuous Post-Mining of Association Rules in a Data Stream Management System.
  13. P Kuntz,F Guillet,R Lehn,H Briand (2000). A User-Driven Process for Mining Association Rules.
  14. Huawen Liu,Jigui Sun,Huijie Zhang (2009). Post-Processing for Rule Reduction Using Closed Set.
  15. Szymon Jaroszewicz,Dan Simovici (2004). Interestingness of frequent itemsets using Bayesian networks as background knowledge.
  16. S Jaroszewicz,T Scheffer (2005). Fast Discovery of Unexpected Patterns in Data, Relative to a Bayesian Network.
  17. C Faure,D Delprat,J Boulicaut,A Mille (2006). Iterative Bayesian Network Implementation by using Annotated Association Rules.
  18. B Liu,W Hsu (1996). Post-Analysis of Learned Rules.
  19. B Lent,A Swami,J Widom (1997). Mining for strong negative associations in a large database of customer transactions.
  20. Sugato Basu,Raymond Mooney,Krupakar Pasupuleti,Joydeep Ghosh (2001). Evaluating the novelty of text-mined rules using lexical knowledge.
  21. Claudia Marinica,Fabrice Guillet (2010). Knowledge-Based Interactive Postmining of Association Rules Using Ontologies.
  22. M Zaki,C Hsiao (2002). Charm: An Efficient Algorithm for Closed Itemset Mining.
  23. J Pei,J Han,R Mao (2000). Closet: An Efficient Algorithm for Mining Frequent Closed Itemsets.
  24. Mohammed Zaki,Srinivasan Parthasarathy,Mitsunori Ogihara,Wei Li (1998). Parallel Algorithms for Discovery of Association Rules.
  25. D Burdick,M Calimlim,J Flannick,J Gehrke,T Yiu (2005). Mafia: A Maximal Frequent Itemset Algorithm.
  26. J Li (2006). On Optimal Rule Discovery.
  27. M Hahsler,C Buchta,K Hornik (2008). Selective Association Rule Generation.
  28. H Toivonen,M Klemettinen,P Ronkainen,K Hatonen,H Mannila (1995). Pruning and Grouping of Discovered Association Rules.
  29. Roberto Bayardo,Rakesh Agrawal (1999). Mining the most interesting rules.
  30. M Klemettinen,H Mannila,P Ronkainen,H Toivonen,A Verkamo (1994). Finding Interesting Rules from Large Sets of Discovered Association Rules.
  31. R Srikant,R (1995). Mining Generalized Association Rules.
  32. Barzan Mozafari,Hetal Thakkar,Carlo Zaniolo (2008). Verifying and Mining Frequent Patterns from Large Windows over Data Streams.
  33. Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset Mining kalli Srinivasa Nageswara Prasad.
  34. S Prof,Ramakrishna (2011). Unknown Title.
  35. Kalli Srinivasa,Nageswara Prasad,Prof Ramakrishna (2011). Global Journal of Computer Science and Technology.
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

Kalli Srinivasa Nageswara Prasad, Prof. S. Ramakrishna. 2011. "Attribute Relational Analysis (ARA) for Coherent Association Rules: A post mining process for Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset". Global Journal of Research in Engineering - I: Numerical Methods GJRE-I Volume 11 (GJRE Volume 11 Issue I7).

More Citation Formats

Download Citation

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

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Keywords
Association Rule MiningClosed itemsetInference analysisPEPPpost miningrule pruning
Classification
GJRE-I Classification FOR Code: 080109
  • Submission ReceivedNovember 1, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted November 21, 2011
  • Published December 3, 2011
Version of record

v1.2

Issue date
December 28, 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: 1.4K
Total Downloads: 58
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.

Attribute Relational Analysis (ARA) for Coherent Association Rules: A post mining process for Parallel Edge Projection and Pruning (PEPP) Based Sequence Graph protrude approach for Closed Itemset

Kalli Prasad
Kalli Prasad Sri Venkateswara University, Tirupati
Prof. Ramakrishna
Prof. Ramakrishna
  • Submission ReceivedNovember 1, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted November 21, 2011
  • Published December 3, 2011