메뉴 건너뛰기




Volumn , Issue , 2009, Pages 119-127

Probabilistic frequent itemset mining in uncertain databases

Author keywords

Frequent itemset mining; Probabilistic data; Probabilistic frequent itemsets; Uncertain databases

Indexed keywords

EXPERIMENTAL EVALUATION; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; ITEMSET; ORDERS OF MAGNITUDE; POSSIBLE WORLD SEMANTICS; POSSIBLE WORLDS; PROBABILISTIC DATA; PROBABILISTIC FORMULATION; PROBABILISTIC FREQUENT ITEMSETS; TRADITIONAL TECHNIQUES; TRANSACTION DATABASE; UNCERTAIN DATABASE; UNCERTAIN DATABASES;

EID: 70350697587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557039     Document Type: Conference Paper
Times cited : (235)

References (18)
  • 7
    • 36148994784 scopus 로고    scopus 로고
    • Eficient query evaluation on probabilistic databases
    • N. Dalvi and D. Suciu. "Eficient query evaluation on probabilistic databases". The VLDB Journal, 16(4):523-544, 2007.
    • (2007) The VLDB Journal , vol.16 , Issue.4 , pp. 523-544
    • Dalvi, N.1    Suciu, D.2
  • 8
    • 70350661066 scopus 로고    scopus 로고
    • Karolien Geurts, Geert Wets, Tom Brijs, and Koen Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16, page 18pp, 2003.
    • Karolien Geurts, Geert Wets, Tom Brijs, and Koen Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16, page 18pp, 2003.
  • 9
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. SIGMOD Rec., 29(2):1-12, 2000.
    • (2000) SIGMOD Rec , vol.29 , Issue.2 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 10
    • 33745576785 scopus 로고    scopus 로고
    • H.-P. Kriegel, P. Kunath, M. Pfei e, and M. Renz. Probabilistic Similarity Join on Uncertain Data. In Proc. 11th Int. Conf. on Database Systems for Advanced Applications, Singapore, pp. 295-309, 2006.
    • H.-P. Kriegel, P. Kunath, M. Pfei e, and M. Renz. "Probabilistic Similarity Join on Uncertain Data". In Proc. 11th Int. Conf. on Database Systems for Advanced Applications, Singapore, pp. 295-309, 2006.
  • 13
    • 34548772330 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • Istanbul, Turkey
    • P. Sen and A. Deshpande. "Representing and querying correlated tuples in probabilistic databases". In Proc. 23rd Int. Conf. on Data Engineering, Istanbul, Turkey, 2007.
    • (2007) Proc. 23rd Int. Conf. on Data Engineering
    • Sen, P.1    Deshpande, A.2
  • 14
    • 34548724406 scopus 로고    scopus 로고
    • M.A. Soliman, I.F. Ilyas, and K. Chen-Chuan Chang. Top-k Query Processing in Uncertain Databases. In Proc. 23rd Int. Conf. on Data Engineering, Istanbul, Turkey, pages 896-905, 2007.
    • M.A. Soliman, I.F. Ilyas, and K. Chen-Chuan Chang. "Top-k Query Processing in Uncertain Databases". In Proc. 23rd Int. Conf. on Data Engineering, Istanbul, Turkey, pages 896-905, 2007.
  • 18
    • 57149143965 scopus 로고    scopus 로고
    • Finding frequent items in probabilistic data
    • Jason Tsong-Li Wang, editor, ACM
    • Qin Zhang, Feifei Li, and Ke Yi. Finding frequent items in probabilistic data. In Jason Tsong-Li Wang, editor, SIGMOD Conference, pages 819-832. ACM, 2008.
    • (2008) SIGMOD Conference , pp. 819-832
    • Zhang, Q.1    Li, F.2    Yi, K.3


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