메뉴 건너뛰기




Volumn 38, Issue 9, 2011, Pages 11630-11640

Interestingness measures for association rules: Combination between lattice and hash tables

Author keywords

Association rules; Frequent itemsets; Frequent itemsets lattice; Hash tables; Interestingness association rules; Interestingness measures

Indexed keywords

FREQUENT ITEMSETS; HASH TABLE; HASH TABLES; INTERESTINGNESS; INTERESTINGNESS MEASURES; MINING ASSOCIATION RULES; MINING FREQUENT ITEMSETS; RIGHT-HAND SIDES;

EID: 79955620201     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.03.042     Document Type: Article
Times cited : (43)

References (28)
  • 1
    • 0002221136 scopus 로고
    • Fast algorithms for mining association rules
    • Agrawal, R.; & Srikant, R. (1994). Fast algorithms for mining association rules. In VLDB'94 (pp. 487-499).
    • (1994) VLDB'94 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 7
    • 0033207925 scopus 로고    scopus 로고
    • On rule interestingness measures
    • DOI 10.1016/S0950-7051(99)00019-2
    • A.A. Freitas On rule interestingness measures Knowledge-based Systems 12 5-6 1999 309 315 (Pubitemid 30511622)
    • (1999) Knowledge-Based Systems , vol.12 , Issue.5-6 , pp. 309-315
    • Freitas, A.A.1
  • 8
    • 27644510774 scopus 로고    scopus 로고
    • Fast algorithms for frequent itemset mining using FP-trees
    • DOI 10.1109/TKDE.2005.166
    • G. Grahne, and J. Zhu Fast algorithms for frequent itemset mining using FP-trees IEEE Transactions on Knowledge and Data Engineering 17 10 2005 1347 1362 (Pubitemid 41560422)
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.10 , pp. 1347-1362
    • Grahne, G.1    Zhu, J.2
  • 12
    • 77957311915 scopus 로고    scopus 로고
    • Diversity-based interestingness measures for association rule mining
    • Las Vegas
    • Huebner, R. A. (2009). Diversity-based interestingness measures for association rule mining. In Proceedings of ASBBS (Vol. 16, p. 1). Las Vegas.
    • (2009) Proceedings of ASBBS , vol.16 , pp. 1
    • Huebner, R.A.1
  • 13
    • 33846426476 scopus 로고    scopus 로고
    • A graph-based clustering approach to evaluate interestingness measures: A tool and a comparative study
    • Springer-Verlag
    • H.X. Huynh, F. Guillet, J. Blanchard, P. Kuntz, R. Gras, and H. Briand A graph-based clustering approach to evaluate interestingness measures: A tool and a comparative study Quality measures in data mining 2007 Springer-Verlag pp. 25-50
    • (2007) Quality Measures in Data Mining
    • Huynh, H.X.1    Guillet, F.2    Blanchard, J.3    Kuntz, P.4    Gras, R.5    Briand, H.6
  • 14
    • 33749565987 scopus 로고    scopus 로고
    • CoMine: Efficient mining of correlated patterns
    • Lee, Y. K.; Kim, W. Y.; Cai, Y.; & Han, J. (2003). CoMine: Efficient mining of correlated patterns. In Proceeding of ICDM'03 (pp. 581-584).
    • (2003) Proceeding of ICDM'03 , pp. 581-584
    • Lee, Y.K.1    Kim, W.Y.2    Cai, Y.3    Han, J.4
  • 15
    • 34548515525 scopus 로고    scopus 로고
    • On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid
    • DOI 10.1016/j.ejor.2006.10.059, PII S0377221706011465
    • P. Lenca, P. Meyer, P. Vaillant, and S. Lallich On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid European Journal of Operational Research 184 2 2008 610 626 (Pubitemid 47374386)
    • (2008) European Journal of Operational Research , vol.184 , Issue.2 , pp. 610-626
    • Lenca, P.1    Meyer, P.2    Vaillant, B.3    Lallich, S.4
  • 16
    • 28544452631 scopus 로고    scopus 로고
    • A survey of interestingness measures for knowledge discovery
    • Cambridge University Press
    • K. MCGarry A survey of interestingness measures for knowledge discovery Knowledge engineering review 2005 Cambridge University Press pp. 1-24
    • (2005) Knowledge Engineering Review
    • McGarry, K.1
  • 19
    • 19544367252 scopus 로고    scopus 로고
    • A transaction-based neighborhood-driven approach to quantifying interestingness of association rules
    • Shekar, B.; & Natarajan, R. (2004). A transaction-based neighborhood-driven approach to quantifying interestingness of association rules. In Proceedings of ICDM'04.
    • (2004) Proceedings of ICDM'04
    • Shekar, B.1    Natarajan, R.2
  • 23
    • 79955593191 scopus 로고    scopus 로고
    • Mining minimal non-redundant association rules using frequent itemsets lattice
    • B. Vo, and B. Le Mining minimal non-redundant association rules using frequent itemsets lattice Journal of Intelligent Systems Technology and Applications 10 1 2011 92 106
    • (2011) Journal of Intelligent Systems Technology and Applications , vol.10 , Issue.1 , pp. 92-106
    • Vo, B.1    Le, B.2
  • 28
    • 17044438212 scopus 로고    scopus 로고
    • Efficient algorithms for mining closed itemsets and their lattice structure
    • DOI 10.1109/TKDE.2005.60
    • M.J. Zaki, and C.J. Hsiao Efficient algorithms for mining closed itemsets and their lattice structure IEEE Transactions on Knowledge and Data Engineering 17 4 2005 462 478 (Pubitemid 40495590)
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.4 , pp. 462-478
    • Zaki, M.J.1    Hsiao, C.-J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.