메뉴 건너뛰기




Volumn 3, Issue 1, 2011, Pages 58-67

The comparative of Boolean Algebra compress and Apriori rule techniques for new theoretic association rule mining model

Author keywords

Apriori rule; Association rule; Boolean algebra

Indexed keywords

ASSOCIATION RULES; DATA MINING; DATABASE SYSTEMS; LEARNING ALGORITHMS;

EID: 79952746962     PISSN: 20058039     EISSN: None     Source Type: Journal    
DOI: 10.4156/ijact.vol3.issue1.7     Document Type: Article
Times cited : (19)

References (17)
  • 6
    • 0002082857 scopus 로고
    • An efficient algorithm for mining association rules in large database
    • Zurich, Switzerland
    • Ashok Savasere, Edward Omiecinski, Shamkant Navathe, "An Efficient Algorithm for Mining Association Rules in Large Database", In Proceeding of the 21st VLDB Conference, pp 432-444, Zurich, Switzerland, 1995.
    • (1995) Proceeding of the 21st VLDB Conference , pp. 432-444
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.3
  • 8
    • 0030156999 scopus 로고    scopus 로고
    • Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization
    • Proceeding of the 1996 ACM - SIGMOD
    • Fukuda, T., Morimoto Y., Morishita, S., Tokuyama, T. "Data Mining using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization". In Proceeding of the 1996 ACM - SIGMOD International Conference on the Management of Data, pp 13-23, 1996.
    • (1996) International Conference on the Management of Data , pp. 13-23
    • Fukuda, T.1    Morimoto, Y.2    Morishita, S.3    Tokuyama, T.4
  • 13
    • 79952745728 scopus 로고    scopus 로고
    • An enhanced scaling apriori for association rule mining efficiency
    • ISSN 1450-216X
    • S.Prakash, R.M.S.Parvathi, An Enhanced Scaling Apriori for Association Rule Mining Efficiency, European Journal of Scientific Research, ISSN 1450-216X Vol.39 No.2, pp.257-264, 2010.
    • (2010) European Journal of Scientific Research , vol.39 , Issue.2 , pp. 257-264
    • Prakash, S.1    Parvathi, R.M.S.2
  • 14
    • 79952749865 scopus 로고    scopus 로고
    • OPAM: An efficient one pass association mining technique without candidate generation
    • S. Roy, D. K. Bhattacharyya, OPAM: An Efficient One Pass Association Mining Technique without Candidate Generation, Journal of JCIT, Vol. 3, No. 3, pp. 32-38, 2008.
    • (2008) Journal of JCIT , vol.3 , Issue.3 , pp. 32-38
    • Roy, S.1    Bhattacharyya, D.K.2
  • 15
    • 78651569073 scopus 로고    scopus 로고
    • Research on classification mining method of frequent itemset
    • Fan Lilin, "Research on Classification Mining Method of Frequent Itemset", Journal of JCIT, Vol. 5, No. 8, pp. 71-77, 2010.
    • (2010) Journal of JCIT , vol.5 , Issue.8 , pp. 71-77
    • Lilin, F.1
  • 16
    • 78651537917 scopus 로고    scopus 로고
    • An implementation of FP-Growth algorithm based on high level data structures of weka-JUNG framework
    • Shui Wang, Le Wang, "An Implementation of FP-Growth Algorithm Based on High Level Data Structures of Weka-JUNG Framework", Journal of JCIT, Vol. 5, No. 9, pp. 287-294, 2010.
    • (2010) Journal of JCIT , vol.5 , Issue.9 , pp. 287-294
    • Wang, S.1    Le, W.2
  • 17
    • 79952749865 scopus 로고    scopus 로고
    • OPAM: An efficient one pass association mining technique without candidate generation
    • S. Roy, D. K. Bhattacharyya, "OPAM: An Efficient One Pass Association Mining Technique without Candidate Generation", Journal of JCIT, Vol. 3, No. 3, pp. 32-38, 2008.
    • (2008) Journal of JCIT , vol.3 , Issue.3 , pp. 32-38
    • Roy, S.1    Bhattacharyya, D.K.2


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