메뉴 건너뛰기




Volumn E87-D, Issue 3, 2004, Pages 761-770

Fast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules

Author keywords

Data mining; Galois lattice; Generalized association rule; Knowledge discovery

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; DATABASE SYSTEMS; FUNCTIONS; MATHEMATICAL MODELS; SET THEORY;

EID: 1642409826     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (26)

References (20)
  • 2
  • 6
    • 0033311838 scopus 로고    scopus 로고
    • Mining multiple-level association rules in large databases
    • J. Han and Y. Fu, "Mining multiple-level association rules in large databases," Knowledge and Data Engineering, vol.11, no.5, pp.798-804, 1999.
    • (1999) Knowledge and Data Engineering , vol.11 , Issue.5 , pp. 798-804
    • Han, J.1    Fu, Y.2
  • 9
    • 21144452945 scopus 로고    scopus 로고
    • A data mining approach to new library book recommendations
    • Singapore, Dec.
    • S.-Y. Hwang and E.-P. Lim, "A data mining approach to new library book recommendations," Lecture Notes in Computer Science ICADL 2002, pp.229-240, Singapore, Dec. 2002.
    • (2002) Lecture Notes in Computer Science ICADL 2002 , pp. 229-240
    • Hwang, S.-Y.1    Lim, E.-P.2
  • 11
    • 0033725593 scopus 로고    scopus 로고
    • Data mining library reuse patterns using generalized association rules
    • A. Michail, "Data mining library reuse patterns using generalized association rules," International Conference on Software Engineering, pp. 167-176, 2000.
    • (2000) International Conference on Software Engineering , pp. 167-176
    • Michail, A.1
  • 14
    • 0031270195 scopus 로고    scopus 로고
    • Mining generalized association rules
    • R. Srikant and R. Agrawal, "Mining generalized association rules," Future Gener. Comput. Syst., vol.13, no.2/3, pp.161-180, 1997.
    • (1997) Future Gener. Comput. Syst. , vol.13 , Issue.2-3 , pp. 161-180
    • Srikant, R.1    Agrawal, R.2
  • 15
    • 33749413116 scopus 로고    scopus 로고
    • A new method for fiding generalized frequent itemsets in generalized association rule mining
    • ed. A. Corradi and M. Daneshmand, Taormina-Giardini Naxos, Italy, July
    • K. Sriphaew and T. Theeramunkong, "A new method for fiding generalized frequent itemsets in generalized association rule mining," Proc. Seventh International Symposium on Computers and Communications, ed. A. Corradi and M. Daneshmand, pp.1040-1045, Taormina-Giardini Naxos, Italy, July 2002.
    • (2002) Proc. Seventh International Symposium on Computers and Communications , pp. 1040-1045
    • Sriphaew, K.1    Theeramunkong, T.2
  • 16
    • 1642331106 scopus 로고    scopus 로고
    • A fast algorithm for building the Hasse diagram of a Galois lattice
    • Combinatoire, Informatique et Applications, Sept.
    • P. Valtchev, R. Missaoui, and P. Lebrun, "A fast algorithm for building the Hasse diagram of a Galois lattice," Colloque LaCIM2000, Combinatoire, Informatique et Applications, pp.293-306, Sept. 2000.
    • (2000) Colloque LaCIM2000 , pp. 293-306
    • Valtchev, P.1    Missaoui, R.2    Lebrun, P.3
  • 18
    • 0347709684 scopus 로고    scopus 로고
    • CHARM: An efficient algorithm for closed itemset mining
    • ed. R. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, Arlington, VA, April
    • M.J. Zaki and C.-J. Hsiao, "CHARM: An efficient algorithm for closed itemset mining," Proc. Second SIAM International Conference on Data Mining, ed. R. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, pp.459-473, Arlington, VA, April 2002.
    • (2002) Proc. Second SIAM International Conference on Data Mining , pp. 459-473
    • Zaki, M.J.1    Hsiao, C.-J.2


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