메뉴 건너뛰기




Volumn 25, Issue 3, 2000, Pages 380-406

Theory of dependence values

Author keywords

1.2.4 Artificial Intelligence : Knowledge Representation Formalisms and Methods; H.1.1 Models and Principles : Systems and Information Theory Information theory; H.2.8 Database Management : Database applications Data mining; Statistical databases

Indexed keywords


EID: 0001754925     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/363951.363956     Document Type: Article
Times cited : (29)

References (20)
  • 2
    • 0008241804 scopus 로고
    • Fast discovery of association rules
    • P. S. U. M. Fayyad, G. Piatetsky-Shapiro, and R. U. Eds, Eds. AAAI Press, Menlo Park, CA
    • AGRAWAL, R., MANNILA, H., SRIKANT, R., TOIVONEN, H., AND VERKAMO, A. I. 1995. Fast discovery of association rules. In Knowledge Discovery in Databases, P. S. U. M. Fayyad, G. Piatetsky-Shapiro, and R. U. Eds, Eds. AAAI Press, Menlo Park, CA.
    • (1995) Knowledge Discovery in Databases
    • Agrawal, R.1    Mannila, H.2    Srikant, R.3    Toivonen, H.4    Verkamo, A.I.5
  • 3
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • VLDB'94, Santiago, Chile, Sept.. VLDB Endowment, Berkeley, CA
    • AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94, Santiago, Chile, Sept.). VLDB Endowment, Berkeley, CA, 487-499.
    • (1994) Proceedings of the 20th International Conference on Very Large Data Bases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • SIGMOD '93, Washington, DC, May 26-28, P. Buneman and S. Jajodia, Eds. ACM Press, New York, NY
    • AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD '93, Washington, DC, May 26-28), P. Buneman and S. Jajodia, Eds. ACM Press, New York, NY, 207-216.
    • (1993) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 6
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic itemset counting and implication rules for market basket data
    • SIGMOD '97, Tucson, AZ, May 13-15, J. M. Peckman, S. Ram, and M. Franklin, Eds. ACM Press, New York, NY
    • BRIN, S., MOTWANI, R., ULLMAN, J. D., AND TSUR, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '97, Tucson, AZ, May 13-15), J. M. Peckman, S. Ram, and M. Franklin, Eds. ACM Press, New York, NY, 255-264.
    • (1997) Proceedings of the ACM SIGMOD International Conference on Management of Data , pp. 255-264
    • Brin, S.1    Motwani, R.2    Ullman, J.D.3    Tsur, S.4
  • 8
    • 0002738566 scopus 로고
    • Knowledge discovery in databases: An attribute-oriented approach
    • Vancouver, B.C., Aug.. VLDB Endowment, Berkeley, CA
    • HAN, J., CAI, Y., AND CERCONE, N. 1992. Knowledge discovery in databases: An attribute-oriented approach. In Proceedings of the 18th International Conference on Very Large Data Bases (Vancouver, B.C., Aug.). VLDB Endowment, Berkeley, CA, 547-559.
    • (1992) Proceedings of the 18th International Conference on Very Large Data Bases , pp. 547-559
    • Han, J.1    Cai, Y.2    Cercone, N.3
  • 13
    • 0000706349 scopus 로고    scopus 로고
    • Pincer-search: A new algorithm for discovering the maximum frequent set
    • EDBT, Valencia, Spain, Mar.
    • LIN, D. AND KEDEM, Z. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In Proceedings of the 6th International Conference on EDBT (EDBT, Valencia, Spain, Mar.).
    • (1998) Proceedings of the 6th International Conference on EDBT
    • Lin, D.1    Kedem, Z.2
  • 15
    • 84976830511 scopus 로고
    • An effective hash based algorithm for mining association rules
    • ACM-SIGMOD, San Jose, CA, May. SIGMOD. ACM Press, New York, NY
    • PARK, J. S., SHEN, M., AND YU, P. S. 1995. An effective hash based algorithm for mining association rules. In Proceedings of the ACM SIGMOD Conference on Management of Data (ACM-SIGMOD, San Jose, CA, May). SIGMOD. ACM Press, New York, NY.
    • (1995) Proceedings of the ACM SIGMOD Conference on Management of Data
    • Park, J.S.1    Shen, M.2    Yu, P.S.3
  • 17
    • 11344285341 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to dependence rules
    • SILVERSTEIN, C., BRIN, S., AND MOTWANI, R. 1998. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining Knowl. Discovery 2, 1, 39-68.
    • (1998) Data Mining Knowl. Discovery , vol.2 , Issue.1 , pp. 39-68
    • Silverstein, C.1    Brin, S.2    Motwani, R.3


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