메뉴 건너뛰기




Volumn 2682, Issue , 2004, Pages 306-323

Integrity constraints over association rules

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33745138628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44497-8_16     Document Type: Article
Times cited : (4)

References (21)
  • 4
    • 0032680184 scopus 로고    scopus 로고
    • Constraint-based rule mining in large, dense databases
    • Sydney, Australia, March
    • R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proceedings ICDE'99, pages 188-197, Sydney, Australia, March 1999.
    • (1999) Proceedings ICDE'99 , pp. 188-197
    • Bayardo, R.1    Agrawal, R.2    Gunopulos, D.3
  • 7
    • 0037243046 scopus 로고    scopus 로고
    • Free-sets: A condensed representation of boolean data for the approximation of frequency queries
    • J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets : a condensed representation of boolean data for the approximation of frequency queries. Journal of Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
    • (2003) Journal of Data Mining and Knowledge Discovery , vol.7 , Issue.1 , pp. 5-22
    • Boulicaut, J.-F.1    Bykowski, A.2    Rigotti, C.3
  • 8
    • 84947721195 scopus 로고    scopus 로고
    • Querying inductive databases: A case study on the MINE RULE operator
    • Proc. PKDD'98 Nantes, F, Springer-Verlag
    • J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Querying inductive databases: A case study on the MINE RULE operator. In Proc. PKDD'98, volume 1510 of LNAI, pages 194-202, Nantes, F, 1998. Springer-Verlag.
    • (1998) LNAI , vol.1510 , pp. 194-202
    • Boulicaut, J.-F.1    Klemettinen, M.2    Mannila, H.3
  • 10
    • 35048877105 scopus 로고    scopus 로고
    • Disjunction-bordered condensed representation of frequent patterns
    • To appear
    • A. Bykowski and C. Rigotti. Disjunction-bordered condensed representation of frequent patterns. Information Systems, To appear.
    • Information Systems
    • Bykowski, A.1    Rigotti, C.2
  • 12
    • 0002784345 scopus 로고    scopus 로고
    • Algorithms for association rule mining - A general survey and comparison
    • July
    • J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64, July 2000.
    • (2000) SIGKDD Explorations , vol.2 , Issue.1 , pp. 58-64
    • Hipp, J.1    Güntzer, U.2    Nakhaeizadeh, G.3
  • 13
    • 0030284618 scopus 로고    scopus 로고
    • A database perspective on knowledge discovery
    • Nov.
    • T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, Nov. 1996.
    • (1996) Communications of the ACM , vol.39 , Issue.11 , pp. 58-64
    • Imielinski, T.1    Mannila, H.2
  • 15
    • 9444249299 scopus 로고    scopus 로고
    • Inductive databases and condensed representations for data mining
    • Port Jefferson, USA, MIT Press
    • H. Mannila. Inductive databases and condensed representations for data mining. In Proc. ILPS'97, pages 21-30, Port Jefferson, USA, 1997. MIT Press.
    • (1997) Proc. ILPS'97 , pp. 21-30
    • Mannila, H.1
  • 16
    • 0033096890 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
    • (1999) Information Systems , vol.24 , Issue.1 , pp. 25-46
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 17
    • 0002877253 scopus 로고
    • Discovery, analysis, and presentation of strong rules
    • AAAI Press, Menlo Park, CA
    • G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248. AAAI Press, Menlo Park, CA, 1991.
    • (1991) Knowledge Discovery in Databases , pp. 229-248
    • Piatetsky-Shapiro, G.1
  • 18
    • 0002082857 scopus 로고
    • An efficient algorithm for mining association rules in large databases
    • Zurich, Switzerland, September Morgan Kaufmann
    • A. Savasere, E. Omiecinski, and S. B. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. VLDB'95, pages 432-444, Zurich, Switzerland, September 1995. Morgan Kaufmann.
    • (1995) Proc. VLDB'95 , pp. 432-444
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.B.3
  • 20
    • 0030157416 scopus 로고    scopus 로고
    • Mining quantitative association rules in large relational tables
    • Montreal, Quebec, Canada, June ACM Press
    • R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. ACM SIGMOD'96, pages 1-12, Montreal, Quebec, Canada, June 1996. ACM Press.
    • (1996) Proc. ACM SIGMOD'96 , pp. 1-12
    • Srikant, R.1    Agrawal, R.2


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