메뉴 건너뛰기




Volumn 22, Issue 6-7, 1997, Pages 333-347

A new and versatile method for association generation

Author keywords

Association Generation; Data Mining; Excluding Association; Knowledge Discovery in Textual Data Bases

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); KNOWLEDGE ACQUISITION;

EID: 0031219754     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0306-4379(97)00021-5     Document Type: Article
Times cited : (38)

References (14)
  • 2
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • Washington, DC
    • R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, pp. 207-216, Washington, DC (1993).
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 3
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Santiago, Chile
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. 20th Int'l Conf. on VLDB, Santiago, Chile (1994).
    • (1994) Proc. 20th Int'l Conf. on VLDB
    • Agrawal, R.1    Srikant, R.2
  • 8
    • 0026914112 scopus 로고
    • Problems for knowledge discovery in databases and their treatment in the statistical interpreter explora
    • W. Kloesgen. Problems for knowledge discovery in databases and their treatment in the statistical interpreter explora. Int'l J. for Intelligent Systems, 7(7):649-673 (1992).
    • (1992) Int'l J. for Intelligent Systems , vol.7 , Issue.7 , pp. 649-673
    • Kloesgen, W.1
  • 14
    • 0004112038 scopus 로고
    • Addison-Wesley, second edition
    • R. Sedgewick. Algorithms. Addison-Wesley, second edition (1988).
    • (1988) Algorithms
    • Sedgewick, R.1


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