메뉴 건너뛰기




Volumn 15, Issue 1, 2003, Pages 57-69

Alternative interest measures for mining associations in databases

Author keywords

Associations; Data mining; Databases; Interest measures; Performance

Indexed keywords

ALGORITHMS; DATA MINING; PATTERN RECOGNITION; PROBLEM SOLVING; SET THEORY;

EID: 0037249129     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2003.1161582     Document Type: Article
Times cited : (372)

References (28)
  • 4
    • 0030403087 scopus 로고    scopus 로고
    • Parallel mining of association rules
    • Dec.
    • R. Agrawal and J. Shafer, "Parallel Mining of Association Rules," IEEE Trans. Knowledge and Data Eng., vol. 8, no. 6, pp. 962-969, Dec. 1996.
    • (1996) IEEE Trans. Knowledge and Data Eng. , vol.8 , Issue.6 , pp. 962-969
    • Agrawal, R.1    Shafer, J.2
  • 7
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • May
    • S. Brin, R. Motwani, and C. Silverstein, "Beyond Market Baskets: Generalizing Association Rules to Correlations," Proc. ACM SIGMOD Conf., pp. 265-276, May 1997.
    • (1997) Proc. ACM SIGMOD Conf. , pp. 265-276
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 8
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic itemset counting and implication rules for market basket data
    • May
    • S. Brin, R. Motwani, J. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," Proc. ACM SIGMOD Conf., pp. 255-264, May 1997.
    • (1997) Proc. ACM SIGMOD Conf. , pp. 255-264
    • Brin, S.1    Motwani, R.2    Ullman, J.3    Tsur, S.4
  • 11
    • 0002401815 scopus 로고
    • Discovery of multiple-level association rules from large databases
    • Sept.
    • J. Han and Y. Eu, "Discovery of Multiple-Level Association Rules from Large Databases," Proc. Very Large Databases Conf., pp. 420-431, Sept. 1995.
    • (1995) Proc. Very Large Databases Conf. , pp. 420-431
    • Han, J.1    Eu, Y.2
  • 15
    • 0347087668 scopus 로고    scopus 로고
    • Optimization of constrained frequent set queries with 2-variable constraints
    • June
    • L. Lakshmanan, R. Ng, J. Han, and A. Pang, "Optimization of Constrained Frequent Set Queries with 2-Variable Constraints," Proc. ACM-SIGMOD Conf. Management of Data, pp. 157-168, June 1999.
    • (1999) Proc. ACM-SIGMOD Conf. Management of Data , pp. 157-168
    • Lakshmanan, L.1    Ng, R.2    Han, J.3    Pang, A.4
  • 18
    • 0012888467 scopus 로고    scopus 로고
    • Algorithms for mining associations rules for binary segmentation of huge categorical databases
    • Sept.
    • Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tkuyama, and K. Yoda, "Algorithms for Mining Associations Rules for Binary Segmentation of Huge Categorical Databases," Proc. Very Large Databases Conf., pp. 380-391, Sept. 1998.
    • (1998) Proc. Very Large Databases Conf. , pp. 380-391
    • Morimoto, Y.1    Fukuda, T.2    Matsuzawa, H.3    Tkuyama, T.4    Yoda, K.5
  • 19
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • June
    • R. Ng, L. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining and Pruning Optimizations of Constrained Associations Rules," Proc. ACM-SIGMOD Conf. Management of Data, pp. 13-24, June 1998.
    • (1998) Proc. ACM-SIGMOD Conf. Management of Data , pp. 13-24
    • Ng, R.1    Lakshmanan, L.2    Han, J.3    Pang, A.4
  • 26
    • 0031698969 scopus 로고    scopus 로고
    • Mining for strong negative associations in a large database of customer transactions
    • Feb.
    • A. Savasere, E. Omiecinski, and S. Navathe, "Mining for Strong Negative Associations in a Large Database of Customer Transactions," Proc. IEEE Data Eng. Conf., Feb. 1998.
    • (1998) Proc. IEEE Data Eng. Conf.
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.3


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