메뉴 건너뛰기




Volumn 24, Issue 12, 2012, Pages 2170-2183

Efficient mining of frequent item sets on large uncertain databases

Author keywords

approximate algorithm; Frequent item sets; incremental mining; uncertain data set

Indexed keywords

APPROXIMATE ALGORITHMS; ATTRIBUTE UNCERTAINTY; BINOMIAL DISTRIBUTION; DATA INTEGRATION; EMERGING APPLICATIONS; EXPONENTIAL NUMBERS; INCREMENTAL MINING; INCREMENTAL MINING ALGORITHMS; ITEM SETS; MINING ALGORITHMS; MINING PROCESS; POSSIBLE WORLD SEMANTICS; POSSIBLE WORLDS; SENSOR MONITORING; SYNTHETIC DATASETS; UNCERTAIN DATABASE; UNCERTAIN DATAS;

EID: 84867943010     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2011.165     Document Type: Article
Times cited : (74)

References (35)
  • 3
    • 63449133366 scopus 로고    scopus 로고
    • A survey of uncertain data algorithms and applications
    • May
    • C. Aggarwal and P. Yu, "A Survey of Uncertain Data Algorithms and Applications," IEEE Trans Knowledge and Data Eng., vol. 21, no. 5, pp. 609-623, May 2009.
    • (2009) IEEE Trans Knowledge and Data Eng. , vol.21 , Issue.5 , pp. 609-623
    • Aggarwal, C.1    Yu, P.2
  • 6
    • 70350697587 scopus 로고    scopus 로고
    • Probabilistic frequent itemset mining in uncertain databases
    • ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD)
    • T. Bernecker, H. Kriegel, M. Renz, F. Verhein, and A. Zuefle, "Probabilistic Frequent Itemset Mining in Uncertain Databases," Proc. 15th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2009.
    • (2009) Proc. 15th
    • Bernecker, T.1    Kriegel, H.2    Renz, M.3    Verhein, F.4    Zuefle, A.5
  • 8
    • 0001043914 scopus 로고
    • An approximation theorem for the poisson binomial distribution
    • L.L. Cam, "An Approximation Theorem for the Poisson Binomial Distribution," Pacific J. Math., vol. 10, pp. 1181-1197, 1960.
    • (1960) Pacific J. Math. , vol.10 , pp. 1181-1197
    • Cam, L.L.1
  • 11
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating technique
    • D. Cheung, J. Han, V. Ng, and C. Wong, "Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique," Proc. 12th Int'l Conf. Data Eng. (ICDE), 1996.
    • (1996) Proc. 12th Int'l Conf. Data Eng. (ICDE)
    • Cheung, D.1    Han, J.2    Ng, V.3    Wong, C.4
  • 29
    • 0003364844 scopus 로고
    • Approximate computation of expectations
    • Inst. of Math. Statistics
    • C. Stein, Approximate Computation of Expectations, Lecture Notes - Monograph Series, vol. 7, Inst. of Math. Statistics, 1986.
    • (1986) Lecture Notes - Monograph Series , vol.7
    • Stein, C.1
  • 31
    • 34250633663 scopus 로고    scopus 로고
    • Avatar information extraction system
    • Mar
    • T. Jayram et al., "Avatar Information Extraction System," IEEE Data Eng. Bull., vol. 29, no. 1, pp. 40-48, Mar. 2006.
    • (2006) IEEE Data Eng. Bull. , vol.29 , Issue.1 , pp. 40-48
    • Jayram, T.1
  • 34
    • 57049119136 scopus 로고    scopus 로고
    • Efficient evaluation of probabilistic advanced spatial queries on existentially uncertain data
    • Jan
    • M. Yiu, N. Mamoulis, X. Dai, Y. Tao, and M. Vaitis, "Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data," IEEE Trans Knowledge and Data Eng., vol. 21, no. 9, pp. 108-122, Jan. 2009.
    • (2009) IEEE Trans Knowledge and Data Eng. , vol.21 , Issue.9 , pp. 108-122
    • Yiu, M.1    Mamoulis, N.2    Dai, X.3    Tao, Y.4    Vaitis, M.5


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