메뉴 건너뛰기




Volumn 3, Issue , 2010, Pages 208-211

Massive data mining based on item sequence set grid space

Author keywords

Data structure; Item sequence set grid space; Massive data mining; Maximum frequent item

Indexed keywords

ASSOCIATION RULES MINING; FREQUENT ITEMS; FREQUENT ITEMSETS; ITEM SETS; MASSIVE DATA; MAXIMUM FREQUENT ITEM; MINING ALGORITHMS; MINING ASSOCIATION RULES; RELATIONAL DATABASE; SEQUENCE SET; TIME SPENT;

EID: 77953041452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAR.2010.5456666     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 1
    • 77953072642 scopus 로고    scopus 로고
    • A Mining Algorithm of Association Rule Based on Linked List
    • 59
    • Zhu Jiaxian. "A Mining Algorithm of Association Rule Based on Linked List". Journal of Shaoxing University, 2004,8(24):19-22,59.
    • (2004) Journal of Shaoxing University , vol.8 , Issue.24 , pp. 19-22
    • Jiaxian, Z.1
  • 3
    • 77953064640 scopus 로고    scopus 로고
    • Association Rules' Mining Architecture Based on Operating Theory of Itemsequences Set
    • Zhang Lei, Liu Zhongjie, Liu Huiwei. "Association Rules' Mining Architecture Based on Operating Theory of Itemsequences Set". Journal of tanzhou Polytechnic College, 2005,4(12):20-24.
    • (2005) Journal of Tanzhou Polytechnic College , vol.4 , Issue.12 , pp. 20-24
    • Lei, Z.1    Zhongjie, L.2    Huiwei, L.3
  • 4
    • 77953068398 scopus 로고    scopus 로고
    • The Designing of Prediction Model on Huge Database and the Analysis of Case Study
    • Wang Yifu, Chen Songqiao, Chen An. "The Designing of Prediction Model on Huge Database and the Analysis of Case Study". Computer Engineering and Applications, 2005,19(41):170-173.
    • (2005) Computer Engineering and Applications , vol.19 , Issue.41 , pp. 170-173
    • Yifu, W.1    Songqiao, C.2    An, C.3
  • 5
    • 77953058401 scopus 로고    scopus 로고
    • MLCI Algorithm for Mining Lower Closed Itemsets
    • 12
    • Bao Zhengyi, Wang Zhoujing. "MLCI Algorithm for Mining Lower Closed Itemsets", Computing Technology and Automation, 2005.12,4(24):73-76.
    • (2005) Computing Technology and Automation , vol.4 , Issue.24 , pp. 73-76
    • Zhengyi, B.1    Zhoujing, W.2
  • 6
    • 33646414176 scopus 로고    scopus 로고
    • Association rules based on levelwise subspace clustering
    • Proceedings. of 9th European conference on principles and practice of knowledge discovery in databases,2005, Heidelberg , Springer
    • Washio T, Nakanishi K, Motoda H. "Association rules based on levelwise subspace clustering", In: Proceedings. of 9th European conference on principles and practice of knowledge discovery in databases,2005, Heidelberg ,LNAI, vol 3721, pp. 692-700 Springer.
    • LNAI , vol.3721 , pp. 692-700
    • Washio, T.1    Nakanishi, K.2    Motoda, H.3
  • 8
    • 77953049697 scopus 로고    scopus 로고
    • An Improvement of Apriori Algorithm for Mining Association Rules
    • 12
    • Zhu Xiaoyu, Wang Lidong, Wang Guangyang. "An Improvement of Apriori Algorithm for Mining Association Rules", Computer Technology and Development, 2006.12,12(16):89-90.
    • (2006) Computer Technology and Development , vol.12 , Issue.16 , pp. 89-90
    • Xiaoyu, Z.1    Lidong, W.2    Guangyang, W.3
  • 9
    • 47849106843 scopus 로고    scopus 로고
    • A Constrained Maximum Frequent Itemsets Incremental Mining Algorithm
    • 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)
    • Han Wang, Lingfu Kong, "A Constrained Maximum Frequent Itemsets Incremental Mining Algorithm", Network and Parallel Computing Workshops, IFIP International Conference on, pp. 743-747, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007), 2007.
    • (2007) Network and Parallel Computing Workshops, IFIP International Conference on , pp. 743-747
    • Wang, H.1    Kong, L.2


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