메뉴 건너뛰기




Volumn , Issue , 2012, Pages 199-204

Mining probabilistic datasets vertically

Author keywords

Data mining; Frequent patterns; Probabilistic databases; Vertical data representation; Vertical mining

Indexed keywords

ARRAY STRUCTURES; DATA REPRESENTATIONS; DATA SETS; FREQUENT PATTERN MINING; FREQUENT PATTERNS; MINING ALGORITHMS; PROBABILISTIC DATABASE; REAL-LIFE APPLICATIONS; TREE-BASED; UNCERTAIN DATAS;

EID: 84866633690     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2351476.2351500     Document Type: Conference Paper
Times cited : (17)

References (23)
  • 1
    • 79959321005 scopus 로고    scopus 로고
    • Frequent pattern mining algorithms with uncertain data
    • ch. 15. Springer
    • C.C. Aggarwal et al.Frequent pattern mining algorithms with uncertain data. In Managing and Mining Uncertain Data, ch. 15. Springer, 2009.
    • (2009) Managing and Mining Uncertain Data
    • Aggarwal, C.C.1
  • 2
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
    • (1994) Proc. VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207-216.
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1
  • 4
    • 70350697587 scopus 로고    scopus 로고
    • Probabilistic frequent itemset mining in uncertain databases
    • T. Bernecker et al. Probabilistic frequent itemset mining in uncertain databases. In Proc. ACM KDD 2009, pp. 119-127.
    • (2009) Proc. ACM KDD , pp. 119-127
    • Bernecker, T.1
  • 5
    • 79956332483 scopus 로고    scopus 로고
    • Efficient pattern mining of uncertain data with sampling
    • T. Calders et al. Efficient pattern mining of uncertain data with sampling. In Proc. PAKDD 2010, Part I, pp. 480-487.
    • (2010) Proc. PAKDD , Issue.PART I , pp. 480-487
    • Calders, T.1
  • 6
    • 84866603679 scopus 로고    scopus 로고
    • Scrubbing query results from probabilistic databases
    • J. Chen et al. Scrubbing query results from probabilistic databases. In Proc. IDEAS 2011, pp. 79-87.
    • (2011) Proc. IDEAS , pp. 79-87
    • Chen, J.1
  • 7
    • 38049177468 scopus 로고    scopus 로고
    • Mining frequent itemsets from uncertain data
    • C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
    • (2007) Proc. PAKDD , pp. 47-58
    • Chui, C.-K.1
  • 8
    • 84855323658 scopus 로고    scopus 로고
    • A clustering-based visualization of colocation patterns
    • E. Desmier et al. A clustering-based visualization of colocation patterns. In Proc. IDEAS 2011, pp. 70-78.
    • (2011) Proc. IDEAS , pp. 70-78
    • Desmier, E.1
  • 10
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
    • (2000) Proc. ACM SIGMOD , pp. 1-12
    • Han, J.1
  • 11
    • 80052323535 scopus 로고    scopus 로고
    • Wiley Interdisc. Rew.: Data Mining and Knowledge Discovery, July/Aug
    • C.K.-S. Leung. Mining uncertain data. Wiley Interdisc. Rew.: Data Mining and Knowledge Discovery, 1(4), July/Aug. 2011, pp. 316-329.
    • (2011) Mining Uncertain Data , vol.1 , Issue.4 , pp. 316-329
    • Leung, C.K.-S.1
  • 12
    • 67649641426 scopus 로고    scopus 로고
    • Mining of frequent itemsets from streams of uncertain data
    • C.K.-S. Leung and B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009, pp. 1663-1670.
    • (2009) Proc. IEEE ICDE , pp. 1663-1670
    • Leung, C.K.-S.1    Hao, B.2
  • 13
    • 79959311325 scopus 로고    scopus 로고
    • Equivalence class transformation based mining of frequent itemsets from uncertain data
    • C.K.-S. Leung and L. Sun. Equivalence class transformation based mining of frequent itemsets from uncertain data. In Proc. ACM SAC 2011, pp. 983-984.
    • (2011) Proc. 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
    • C.K.-S. Leung and S.K. Tanbeer. Fast tree-based mining of frequent itemsets from uncertain data. In Proc. DASFAA 2012, Part I, pp. 272-287.
    • (2012) Proc. DASFAA , Issue.PART I , pp. 272-287
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 15
    • 84866662074 scopus 로고    scopus 로고
    • Mining popular patterns from transactional databases
    • C.K.-S. Leung and S.K. Tanbeer. Mining popular patterns from transactional databases. In Proc. DaWaK 2012, pp. 291-302.
    • (2012) Proc. DaWaK , pp. 291-302
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 16
    • 84872797844 scopus 로고    scopus 로고
    • Mining social networks for significant friend groups
    • C.K.-S. Leung and S.K. Tanbeer. Mining social networks for significant friend groups. In Proc. DASFAA Workshops 2012, pp. 180-192.
    • (2012) Proc. DASFAA Workshops , pp. 180-192
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 17
    • 84855303580 scopus 로고    scopus 로고
    • A landmark-model based system for mining frequent patterns from uncertain data streams
    • C.K.-S. Leung et al. A landmark-model based system for mining frequent patterns from uncertain data streams. In Proc. IDEAS 2011, pp. 249-250.
    • (2011) Proc. IDEAS , pp. 249-250
    • Leung, C.K.-S.1
  • 18
    • 44649151137 scopus 로고    scopus 로고
    • A tree-based approach for frequent pattern mining from uncertain data
    • C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
    • (2008) Proc. PAKDD , pp. 653-661
    • Leung, C.K.-S.1
  • 19
    • 78649956077 scopus 로고    scopus 로고
    • UCFS2: An enhanced system that mines uncertain data for constrained frequent sets
    • C.K.-S. Leung et al. uCFS2: an enhanced system that mines uncertain data for constrained frequent sets. In Proc. IDEAS 2010, pp. 32-37.
    • (2010) Proc. IDEAS , pp. 32-37
    • Leung, C.K.-S.1
  • 20
    • 78149320187 scopus 로고    scopus 로고
    • H-Mine: Hyper-structure mining of frequent patterns in large databases
    • J. Pei et al. H-Mine: Hyper-structure mining of frequent patterns in large databases. In Proc. IEEE ICDM 2001, pp. 441-448.
    • (2001) Proc. IEEE ICDM , pp. 441-448
    • Pei, J.1
  • 21
    • 0005810893 scopus 로고    scopus 로고
    • Turbo-charging vertical mining of large databases
    • P. Shenoy et al. Turbo-charging vertical mining of large databases. In Proc. ACM SIGMOD 2000, pp. 22-33.
    • (2000) Proc. ACM SIGMOD , pp. 22-33
    • Shenoy, P.1
  • 22
    • 85138646379 scopus 로고    scopus 로고
    • New algorithms for fast discovery of association rules
    • M.J. Zaki et al. New algorithms for fast discovery of association rules. In Proc. KDD 1997, pp. 283-286.
    • (1997) Proc. KDD , pp. 283-286
    • Zaki, M.J.1
  • 23
    • 57149143965 scopus 로고    scopus 로고
    • Finding frequent items in probabilistic data
    • Q. Zhang et al. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819-832.
    • (2008) Proc. ACM SIGMOD , pp. 819-832
    • Zhang, Q.1


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