메뉴 건너뛰기




Volumn 6118 LNAI, Issue PART 1, 2010, Pages 480-487

Efficient pattern mining of uncertain data with sampling

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC SOLUTIONS; DATA SETS; EMPIRICAL EVALUATIONS; FREQUENT ITEMSET MINING; GAIN EFFICIENCY; LOW LOSS; MINING FREQUENT ITEMSETS; PATTERN MINING; POSSIBLE WORLDS; SYNTHETIC DATA; UNCERTAIN DATAS;

EID: 79956332483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13657-3_51     Document Type: Conference Paper
Times cited : (61)

References (11)
  • 1
    • 70350664429 scopus 로고    scopus 로고
    • Frequent pattern mining with uncertain data
    • ACM, New York
    • Aggarwal, C.C., Li, Y.,Wang, J.,Wang, J.: Frequent pattern mining with uncertain data. In: Proc. of KDD 2009, pp. 29-38. ACM, New York (2009)
    • (2009) Proc. of KDD 2009 , pp. 29-38
    • Aggarwal, C.C.1    Li, Y.2    Wang, J.3    Wang, J.4
  • 2
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Morgan Kaufmann Publishers Inc, San Francisco
    • Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of VLDB 1994, pp. 487-499. Morgan Kaufmann Publishers Inc, San Francisco (1994)
    • (1994) Proc. of VLDB 1994 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 4
    • 38049177468 scopus 로고    scopus 로고
    • Mining frequent itemsets from uncertain data
    • Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. Springer, Heidelberg
    • Chui, C.K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47-58. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4426 , pp. 47-58
    • Chui, C.K.1    Kao, B.2    Hung, E.3
  • 6
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • DOI 10.1023/B:DAMI.0000005258.31418.83
    • Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53-87 (2004) (Pubitemid 39019971)
    • (2004) Data Mining and Knowledge Discovery , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 8
    • 78149320187 scopus 로고    scopus 로고
    • H-mine: Hyper-structure mining of frequent patterns in large databases
    • Washington, DC, USA, IEEE Computer Society, Los Alamitos
    • Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proc. of ICDM 2001, Washington, DC, USA, pp. 441-448. IEEE Computer Society, Los Alamitos (2001)
    • (2001) Proc. of ICDM 2001 , pp. 441-448
    • Pei, J.1    Han, J.2    Lu, H.3    Nishio, S.4    Tang, S.5    Yang, D.6
  • 10
    • 6344277753 scopus 로고    scopus 로고
    • Fast vertical mining using diffsets
    • Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.). ACM, New York
    • Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) Proc. of KDD 2003, pp. 326-335. ACM, New York (2003)
    • (2003) Proc. of KDD 2003 , pp. 326-335
    • Zaki, M.J.1    Gouda, K.2


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