메뉴 건너뛰기




Volumn 243, Issue , 2012, Pages 1273-1282

Vertical frequent pattern mining from uncertain data

Author keywords

Advanced knowledge based systems; data mining; frequent itemsets; probabilistic databases

Indexed keywords

DATA MINING; DATABASE SYSTEMS; TREES (MATHEMATICS);

EID: 84879118813     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-105-2-1273     Document Type: Article
Times cited : (11)

References (18)
  • 1
    • 70350664429 scopus 로고    scopus 로고
    • Frequent pattern mining with uncertain data
    • Aggarwal, C.C., Li, Y.,Wang, J.,Wang, J.: Frequent pattern mining with uncertain data. In: ACM KDD 2009, pp. 29-37
    • (2009) ACM KDD , pp. 29-37
    • Aggarwal, C.C.1    Li, Y.2    Wang, J.3    Wang, J.4
  • 2
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487-499
    • (1994) VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 80053156981 scopus 로고    scopus 로고
    • An efficient itemset mining approach for data stream
    • Baralis, E., Cerquitelli, T., Chiusano, S., Grand, A., Grimaudo, L.: An efficient itemset mining approach for data stream. In: KES 2011, Part II. LNAI 6882, pp. 515-523
    • (2011) KES , vol.LNAI 6882 , Issue.PART 2 , pp. 515-523
    • Baralis, E.1    Cerquitelli, T.2    Chiusano, S.3    Grand, A.4    Grimaudo, L.5
  • 4
    • 70350697587 scopus 로고    scopus 로고
    • Probabilistic frequent itemset mining in uncertain databases
    • Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Zufle, A.: Probabilistic frequent itemset mining in uncertain databases. In: ACM KDD 2009, pp. 119-127
    • (2009) ACM KDD , pp. 119-127
    • Bernecker, T.1    Kriegel, H.-P.2    Renz, M.3    Verhein, F.4    Zufle, A.5
  • 5
    • 79956332483 scopus 로고    scopus 로고
    • Efficient pattern mining of uncertain data with sampling
    • Calders, T., Garboni, C., Goethals, B.: Efficient pattern mining of uncertain data with sampling. In: PAKDD 2010, Part I. LNAI 6118, pp. 480-487
    • (2010) PAKDD , vol.LNAI 6118 , Issue.PART 1 , pp. 480-487
    • Calders, T.1    Garboni, C.2    Goethals, B.3
  • 6
    • 80053140189 scopus 로고    scopus 로고
    • Improved travel time prediction algorithms for intelligent transportation systems
    • Chowdhury, N.K., Leung, C.K.-S.: Improved travel time prediction algorithms for intelligent transportation systems. In: KES 2011, Part II. LNAI 6882, pp. 355-365
    • (2011) KES , vol.LNAI 6882 , Issue.PART 2 , pp. 355-365
    • Chowdhury, N.K.1    Leung, C.K.-S.2
  • 7
    • 38049177468 scopus 로고    scopus 로고
    • Mining frequent itemsets from uncertain data
    • Chui, C.-K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: PAKDD 2007. LNAI 4426, pp. 47-58
    • (2007) PAKDD , vol.LNAI 4426 , pp. 47-58
    • Chui, C.-K.1    Kao, B.2    Hung, E.3
  • 8
    • 85086032933 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1-12
    • (2000) ACM SIGMOD , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 10
    • 67649641426 scopus 로고    scopus 로고
    • Mining of frequent itemsets from streams of uncertain data
    • Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: IEEE ICDE 2009, pp. 1663-1670
    • (2009) IEEE ICDE , pp. 1663-1670
    • Leung, C.K.-S.1    Hao, B.2
  • 11
    • 80052314165 scopus 로고    scopus 로고
    • Frequent pattern mining from time-fading streams of uncertain data
    • Leung, C.K.-S., Jiang, F.: Frequent pattern mining from time-fading streams of uncertain data. In: DaWaK 2011. LNCS 6862, pp. 252-264
    • (2011) DaWaK , vol.LNCS 6862 , pp. 252-264
    • Leung, C.K.-S.1    Jiang, F.2
  • 12
    • 44649151137 scopus 로고    scopus 로고
    • A tree-based approach for frequent pattern mining from uncertain data
    • Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: PAKDD 2008. LNAI 5012, pp. 653-661
    • (2008) PAKDD , vol.LNAI 5012 , pp. 653-661
    • Leung, C.K.-S.1    Mateo, M.A.F.2    Brajczuk, D.A.3
  • 13
    • 79959311325 scopus 로고    scopus 로고
    • Equivalence class transformation based mining of frequent itemsets from uncertain data
    • Leung, C.K.-S., Sun, L.: Equivalence class transformation based mining of frequent itemsets from uncertain data. In: ACM SAC 2011, pp. 983-984
    • (2011) ACM SAC , pp. 983-984
    • Leung, C.K.-S.1    Sun, L.2
  • 14
    • 84860697181 scopus 로고    scopus 로고
    • Fast tree-based mining of frequent itemsets from uncertain data
    • Leung, C.K.-S., Tanbeer, S.K.: Fast tree-based mining of frequent itemsets from uncertain data. In: DASFAA 2012, Part I. LNCS 7238, pp. 272-287
    • (2012) DASFAA , vol.LNCS 7238 , Issue.PART 1 , pp. 272-287
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 15
    • 78149320187 scopus 로고    scopus 로고
    • H-Mine: Hyper-structure mining of frequent patterns in large databases
    • Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: hyper-structure mining of frequent patterns in large databases. In: IEEE ICDM 2001, pp. 441-448
    • (2001) IEEE ICDM , pp. 441-448
    • Pei, J.1    Han, J.2    Lu, H.3    Nishio, S.4    Tang, S.5    Yang, D.6
  • 17
    • 85138646379 scopus 로고    scopus 로고
    • New algorithms for fast discovery of association rules
    • Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD 1997, pp. 283-286
    • (1997) KDD , pp. 283-286
    • Zaki, M.J.1    Parthasarathy, S.2    Ogihara, M.3    Li, W.4
  • 18
    • 57149143965 scopus 로고    scopus 로고
    • Finding frequent items in probabilistic data
    • Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: ACM SIGMOD 2008, pp. 819-832.
    • (2008) ACM SIGMOD , pp. 819-819
    • Zhang, Q.1    Li, F.2    Yi, K.3


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