메뉴 건너뛰기




Volumn , Issue , 2003, Pages 104-110

Efficiently mining maximal frequent sets for discovering association rules

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DATASETS; BETTER PERFORMANCE; BOTTOM UP; CALIFORNIA; DATA TRANSFORMATION; FREQUENT SETS; TOPDOWN;

EID: 84879106004     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2003.1214916     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 2
    • 0001930158 scopus 로고    scopus 로고
    • Technical report, IBM Almaden Research Center Retrieved from October 2002
    • Agrawal R. et al, "The Quest Data Mining System" , Technical report, IBM Almaden Research Center, 1996, Retrieved from http://www.almaden. ibm.com/cs/quest/in October 2002.
    • (1996) The Quest Data Mining System
    • Agrawal, R.1
  • 8
    • 84879079078 scopus 로고    scopus 로고
    • Data pre-processing for association rule mining
    • Indian Institute of Management, Lucknow
    • Srikumar, K., Bhasker, B., "Data Pre-processing for Association Rule Mining" , Working Paper Series 2002-19, Indian Institute of Management, Lucknow, 2002.
    • (2002) Working Paper Series 2002-19
    • Srikumar, K.1    Bhasker, B.2
  • 9
    • 84910068831 scopus 로고    scopus 로고
    • An algorithm for mining maximal frequent sets based on dominancy of transactions
    • Angers, France
    • Srikumar, K., Bhasker, B., "An Algorithm for Mining Maximal Frequent Sets based on Dominancy of Transactions ", To To Appear in Proc. of Intl. Conf. on Enterprise Information Systems, Angers, France, 2003.
    • (2003) Proc. of Intl. Conf. on Enterprise Information Systems
    • Srikumar, K.1    Bhasker, B.2


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