An alternative interestingness measure for mining periodic-frequent patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6587 LNCS, Issue PART 1, 2011, Pages 183-192

  Kiran, R Uday ^a   Reddy, P Krishna ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Data mining; frequent patterns; knowledge discovery; periodic frequent pattern

Indexed keywords

FREQUENT PATTERNS; GROWTH ALGORITHMS; INTERESTINGNESS MEASURES; KNOWLEDGE DISCOVERY; REAL-WORLD APPLICATION; TRANSACTIONAL DATABASE;

ASSOCIATION RULES; DATA MINING;

DATABASE SYSTEMS;

EID: 79955090315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20149-3_15     Document Type: Conference Paper

References (4)

1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207-216. ACM, New York (1993)
2. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53-87 (2004)
3. Kiran, R.U., Reddy, P.K.: Towards efficient mining of periodic-frequent patterns in transactional databases. In: DEXA, vol. (2), pp. 194-208 (2010)
4. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 242-253. Springer, Heidelberg (2009)