메뉴 건너뛰기




Volumn , Issue , 2003, Pages 276-285

Screening and interpreting multi-item associations based on log-linear modeling

Author keywords

Association rule; Graphical model; Log linear model

Indexed keywords

ASSOCIATION PATTERNS; CLASSICAL APPROACH; DATA MINING COMMUNITY; DATA SETS; GRAPHICAL MODEL; HIGHER ORDER; LARGE DATASETS; LINEAR MODELING; LOGLINEAR MODEL; MULTI-ITEM; SYNTHETIC DATASETS; THEORETICAL RESULT;

EID: 26944470512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956783     Document Type: Conference Paper
Times cited : (20)

References (22)
  • 7
    • 0018086945 scopus 로고
    • Stratigies for the selection of loglinear models
    • J. Benedetti and M. Brown. Stratigies for the selection of loglinear models. Biometrics, 34:680-686, 1978.
    • (1978) Biometrics , vol.34 , pp. 680-686
    • Benedetti, J.1    Brown, M.2
  • 9
    • 0017147047 scopus 로고
    • Screening effects in multidimensional contigency tables
    • M. Brown. Screening effects in multidimensional contigency tables. Applied Statistics, 25:37-46, 1976.
    • (1976) Applied Statistics , vol.25 , pp. 37-46
    • Brown, M.1
  • 13
    • 84940398039 scopus 로고
    • The analysis of multidimensional contigency tables: Stepwise procedures and direct estimation methods for building models for multiple classifications
    • L. Goodman. The analysis of multidimensional contigency tables: Stepwise procedures and direct estimation methods for building models for multiple classifications. Technometrics, 13:33-61, 1971.
    • (1971) Technometrics , vol.13 , pp. 33-61
    • Goodman, L.1
  • 17
    • 0012950021 scopus 로고    scopus 로고
    • Probabilistic models for query approximation with large sparse binary data sets
    • Stanford, California, June
    • D. Pavlov, H. Mannila, and P. Symth. Probabilistic models for query approximation with large sparse binary data sets. In Proceedings of Uncertainty in Artificial Intelligence, pages 199-210. Stanford, California, June 2000.
    • (2000) Proceedings of Uncertainty in Artificial Intelligence , pp. 199-210
    • Pavlov, D.1    Mannila, H.2    Symth, P.3
  • 19
    • 11344285341 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to dependence rules
    • C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:39-68, 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , pp. 39-68
    • Silverstein, C.1    Brin, S.2    Motwani, R.3
  • 20
    • 0000455611 scopus 로고
    • Decomposition by clique separators
    • R. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55:221-232, 1985.
    • (1985) Discrete Mathematics , vol.55 , pp. 221-232
    • Tarjan, R.1


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