메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Novel algorithm for mining high utility itemsets

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL DATASETS; DATA MINING PROCESS; DATA MINING TASKS; EXPERIMENTAL EVALUATIONS; FREQUENT ITEM SETS; FREQUENT ITEMSET; HIGH FREQUENCIES; HUMAN USERS; INTERESTINGNESS; ITEM SETS; ITEMSET MININGS; MINING FREQUENT ITEMSETS; NOVEL ALGORITHMS; RESEARCH AREAS; STATISTICAL CORRELATIONS; TRANSACTION DATABASE; UTILITY MEASURES; UTILITY MININGS;

EID: 63649150994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCNET.2008.4787766     Document Type: Conference Paper
Times cited : (7)

References (16)
  • 3
    • 33749319347 scopus 로고    scopus 로고
    • Interestingness measures for data mining: A survey
    • Article 9
    • Geng L and Hamilton H J, 'Interestingness measures for data mining: A survey', ACM Computing Surveys, Vol. 38, No.3, Article 9, 2006.
    • (2006) ACM Computing Surveys , vol.38 , Issue.3
    • Geng, L.1    Hamilton, H.J.2
  • 4
    • 33749250911 scopus 로고    scopus 로고
    • Mining itemset utilities from transaction databases
    • Yao H and Hamilton H J, 'Mining itemset utilities from transaction databases', Data & Knowledge Engineering, pp. 59: 603-626, 2006.
    • (2006) Data & Knowledge Engineering , vol.59 , pp. 603-626
    • Yao, H.1    Hamilton, H.J.2
  • 8
    • 0345929952 scopus 로고    scopus 로고
    • Mining weighted association rules
    • 3, 211-225
    • Lu S, Hu H, Li F, 'Mining weighted association rules', Intelligent Data Analysis, pp. 5(3): 211-225, 2001.
    • (2001) Intelligent Data Analysis , pp. 5
    • Lu, S.1    Hu, H.2    Li, F.3
  • 10
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • 3, 241-258
    • Mannila H and Toivonen H, 'Levelwise search and borders of theories in knowledge discovery', Data Mining and Knowledge Discovery, pp. 1(3): 241-258, 1997.
    • (1997) Data Mining and Knowledge Discovery , pp. 1
    • Mannila, H.1    Toivonen, H.2
  • 11
    • 28244494064 scopus 로고    scopus 로고
    • Burdick D, Calimlim M, Flannick J, Gehrke J and Yiu T, 'MAFIA: a maximal frequent itemset algorithm', IEEE Transactions on Knowledge and Data Engineering, pp. 17(11): 1490-1504,2005.
    • Burdick D, Calimlim M, Flannick J, Gehrke J and Yiu T, 'MAFIA: a maximal frequent itemset algorithm', IEEE Transactions on Knowledge and Data Engineering, pp. 17(11): 1490-1504,2005.
  • 12
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • 1, 53-87
    • Han J, Pei J, Yin Y and Mao R, 'Mining frequent patterns without candidate generation: a frequent-pattern tree approach', Data Mining and Knowledge Discovery, pp. 8(1): 53-87, 2004.
    • (2004) Data Mining and Knowledge Discovery , pp. 8
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 14
    • 38549157965 scopus 로고    scopus 로고
    • Jieh-shan yeh, Yu-Chiang Li and Chin - Chen Chang, 'Two-Phase Algorithms for a Novel Utility-Frequent mining Model', PAKDD Workshop, pp. 433-444, 2007.
    • Jieh-shan yeh, Yu-Chiang Li and Chin - Chen Chang, 'Two-Phase Algorithms for a Novel Utility-Frequent mining Model', PAKDD Workshop, pp. 433-444, 2007.


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