메뉴 건너뛰기




Volumn 7448 LNCS, Issue , 2012, Pages 205-216

A fast algorithm for frequent itemset mining using Patricia* structures

Author keywords

Data mining; frequent itemset; prefix tree

Indexed keywords

DATA MINING TASKS; FAST ALGORITHMS; FP GROWTHS; FREQUENT ITEMSET; FREQUENT ITEMSET MINING; ITEM SETS; PREFIX-TREE; STORAGE STRUCTURES;

EID: 84866706493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32584-7_17     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 1
    • 0027621699 scopus 로고
    • Mining Association Rules between Sets of Items in Large Databases
    • Agrawal, R., Imieliński, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. ACM SIGMOD, pp. 207-216 (1993)
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imieliński, T.2    Swami, A.3
  • 2
    • 79951753038 scopus 로고    scopus 로고
    • Approximation of Frequentness Probability of Itemsets in Uncertain Data
    • Calders, T., Garboni, C., Goethals, B.: Approximation of Frequentness Probability of Itemsets in Uncertain Data. In: Proc. IEEE ICDM, pp. 749-754 (2010)
    • (2010) Proc. IEEE ICDM , pp. 749-754
    • Calders, T.1    Garboni, C.2    Goethals, B.3
  • 4
    • 27644510774 scopus 로고    scopus 로고
    • Fast Algorithms for Frequent Itemset Mining Using FP-Trees
    • Grahne, G., Zhu, J.: Fast Algorithms for Frequent Itemset Mining Using FP-Trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347-1362 (2005)
    • (2005) IEEE Trans. Knowl. Data Eng. , vol.17 , Issue.10 , pp. 1347-1362
    • Grahne, G.1    Zhu, J.2
  • 5
    • 2442449952 scopus 로고    scopus 로고
    • Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach*
    • Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach*. Data Min. Knowl. Disc. 8(1), 53-87 (2004)
    • (2004) Data Min. Knowl. Disc. , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 6
    • 0000811402 scopus 로고
    • Sorting and Searching
    • Addison Wesley, Reading
    • Knuth, D.: The Art of Computer Programming, vol 3: Sorting and Searching. Addison Wesley, Reading (1973)
    • (1973) The Art of Computer Programming , vol.3
    • Knuth, D.1
  • 7
    • 77956220478 scopus 로고    scopus 로고
    • Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows
    • Lam, H.T., Calders, T.: Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows. In: Proc. ACM SIGKDD, pp. 283-292 (2010)
    • (2010) Proc. ACM SIGKDD , pp. 283-292
    • Lam, H.T.1    Calders, T.2
  • 8
    • 33751160855 scopus 로고    scopus 로고
    • Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree
    • Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree. Data Min. Knowl. Disc. 9(3), 249-274 (2004)
    • (2004) Data Min. Knowl. Disc. , vol.9 , Issue.3 , pp. 249-274
    • Liu, G.1    Lu, H.2    Lou, W.3    Xu, Y.4    Yu, J.X.5
  • 12
    • 62249183038 scopus 로고    scopus 로고
    • FIUT: A New Method for Mining Frequent Itemsets
    • Tsay, Y.J., Hsu, T.J., Yu, J.R.: FIUT: A New Method for Mining Frequent Itemsets. Inf. Sci. 179(11), 1724-1737 (2009)
    • (2009) Inf. Sci. , vol.179 , Issue.11 , pp. 1724-1737
    • Tsay, Y.J.1    Hsu, T.J.2    Yu, J.R.3
  • 13
    • 6344277753 scopus 로고    scopus 로고
    • Fast Vertical Mining Using Diffsets
    • Zaki, M.J., Gouda, K.: Fast Vertical Mining Using Diffsets. In: Proc. ACM SIGKDD, pp. 326-335 (2003)
    • (2003) Proc. ACM SIGKDD , pp. 326-335
    • Zaki, M.J.1    Gouda, K.2


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