메뉴 건너뛰기




Volumn 19, Issue 7, 2005, Pages 677-689

ARMGA: Identifying interesting association rules with genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; GENETIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

EID: 23744471269     PISSN: 08839514     EISSN: None     Source Type: Journal    
DOI: 10.1080/08839510590967316     Document Type: Article
Times cited : (31)

References (20)
  • 1
    • 0001783073 scopus 로고    scopus 로고
    • A new framework for itemset generation
    • Seattle, WA, USA, June 1998
    • Aggarawal, C. and P. Yu. 1998. A new framework for itemset generation. In Proceedings of the PODS Conference, Seattle, WA, USA, June 1998, pages 18-24.
    • (1998) Proceedings of the PODS Conference , pp. 18-24
    • Aggarawal, C.1    Yu, P.2
  • 3
    • 0036031891 scopus 로고    scopus 로고
    • An evolutionary approach for discovering changing patterns in historical data
    • Au, W. and C. Chan. 2002. An evolutionary approach for discovering changing patterns in historical data. In Proceedings of 2002 SPIE, 4730:398-409.
    • (2002) Proceedings of 2002 SPIE , vol.4730 , pp. 398-409
    • Au, W.1    Chan, C.2
  • 6
  • 8
    • 0012141368 scopus 로고    scopus 로고
    • A survey of evolutionary algorithms for data mining and knowledge discovery
    • Berlin, Springer-Verlag
    • Freitas, A. 2002. A survey of evolutionary algorithms for data mining and knowledge discovery. In: Advances in Evolutionary Computation, Berlin, Springer-Verlag.
    • (2002) Advances in Evolutionary Computation
    • Freitas, A.1
  • 10
    • 0034593047 scopus 로고    scopus 로고
    • Small is beautiful: Discovering the minimal set of unexpected patterns
    • Dallas, TX, USA
    • Padmanabhan, B. and A. Tuzhilin. 2000. Small is beautiful: Discovering the minimal set of unexpected patterns. In Proceedings of ACM SIGKDD, Dallas, TX, USA, pages 54-63.
    • (2000) Proceedings of ACM SIGKDD , pp. 54-63
    • Padmanabhan, B.1    Tuzhilin, A.2
  • 11
    • 0031220368 scopus 로고    scopus 로고
    • Using a hash-based method with transaction trimming for mining association rules
    • Park, J., M. Chen, and P. Yu. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowledge and Data Eng. 9(5): 813-824
    • (1997) IEEE Trans. Knowledge and Data Eng. , vol.9 , Issue.5 , pp. 813-824
    • Park, J.1    Chen, M.2    Yu, P.3
  • 13
    • 0002877253 scopus 로고
    • Discovery, analysis and presentation of strong rules
    • eds. G. Piatetsky-Shapiro and W. Frawley, Cambridge, MA: AMI Press/MIT Press
    • Piatetsky-Shapiro, G. 1991. Discovery, analysis and presentation of strong rules. In: Knowledge Discovery in Databases, eds. G. Piatetsky-Shapiro and W. Frawley, 229-248, Cambridge, MA: AMI Press/MIT Press.
    • (1991) Knowledge Discovery in Databases , pp. 229-248
    • Piatetsky-Shapiro, G.1
  • 16
    • 0034592782 scopus 로고    scopus 로고
    • Efficient search for association rules
    • New York
    • Webb, G. 2000. Efficient search for association rules. In Proceedings of ACM SIGKDD, New York, pages 99-107.
    • (2000) Proceedings of ACM SIGKDD , pp. 99-107
    • Webb, G.1
  • 20
    • 0037275123 scopus 로고    scopus 로고
    • Identifying approximate itemsets of interest in large databases
    • Zhang, C., S. Zhang, and G. Webb. 2003. Identifying approximate itemsets of interest in large databases. Applied Intelligence 18: 91-104.
    • (2003) Applied Intelligence , vol.18 , pp. 91-104
    • Zhang, C.1    Zhang, S.2    Webb, G.3


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