메뉴 건너뛰기




Volumn 2015-January, Issue January, 2014, Pages 480-489

A Statistically Efficient and Scalable Method for Log-Linear Analysis of High-Dimensional Data

Author keywords

Association discovery; Data modeling; Graphical models; High dimensional data; Information theory; Log linear Analysis; Statistical inference

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA MINING; DATA STRUCTURES; EFFICIENCY; INFORMATION THEORY; SCALABILITY; STATISTICS;

EID: 84936937505     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2014.23     Document Type: Conference Paper
Times cited : (10)

References (28)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases, " in Int. Conf. on Very Large Data Bases, 1994, pp. 487-499.
    • (1994) Int. Conf. on Very Large Data Bases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 34249653461 scopus 로고    scopus 로고
    • Discovering significant patterns
    • G. I. Webb, "Discovering significant patterns, " Machine Learning, vol. 68, no. 1, pp. 1-33, 2007.
    • (2007) Machine Learning , vol.68 , Issue.1 , pp. 1-33
    • Webb, G.I.1
  • 5
    • 84872385866 scopus 로고    scopus 로고
    • Summarizing categorical data by clustering attributes
    • M. Mampaey and J. Vreeken, "Summarizing categorical data by clustering attributes, " Data Mining and Knowledge Discovery, vol. 26, no. 1, pp. 130-173, 2013.
    • (2013) Data Mining and Knowledge Discovery , vol.26 , Issue.1 , pp. 130-173
    • Mampaey, M.1    Vreeken, J.2
  • 8
    • 33847323262 scopus 로고    scopus 로고
    • Statistical and inductive inference by minimum message length, ser
    • Springer-Verlag
    • C. S. Wallace, Statistical and Inductive Inference by Minimum Message Length, ser. Information Science and Statistics. Springer-Verlag, 2005.
    • (2005) Information Science and Statistics
    • Wallace, C.S.1
  • 10
    • 0026225564 scopus 로고
    • Approximating discrete probability distributions with decomposable models
    • F. Malvestuto, " Approximating discrete probability distributions with decomposable models," IEEE Transactions on Systems, Man and Cybernetics, vol. 21, no. 5, pp. 1287-1294, 1991.
    • (1991) IEEE Transactions on Systems, Man and Cybernetics , vol.21 , Issue.5 , pp. 1287-1294
    • Malvestuto, F.1
  • 12
    • 33344477330 scopus 로고    scopus 로고
    • Minimal triangulations of graphs: A survey
    • P. Heggernes, "Minimal triangulations of graphs: A survey, " Discrete Mathematics, vol. 306, no. 3, pp. 297-317, 2006.
    • (2006) Discrete Mathematics , vol.306 , Issue.3 , pp. 297-317
    • Heggernes, P.1
  • 14
    • 84867501988 scopus 로고    scopus 로고
    • Maximum likelihood estimation in log-linear models
    • S. E. Fienberg and A. Rinaldo, "Maximum likelihood estimation in log-linear models, " Annals of Statistics, vol. 40, no. 2, pp. 996-1023, 2012.
    • (2012) Annals of Statistics , vol.40 , Issue.2 , pp. 996-1023
    • Fienberg, S.E.1    Rinaldo, A.2
  • 16
    • 0000107517 scopus 로고
    • An information measure for classification
    • C. S. Wallace and D. M. Boulton, "An information measure for classification, " The Computer Journal, vol. 11, no. 2, pp. 185-194, 1968.
    • (1968) The Computer Journal , vol.11 , Issue.2 , pp. 185-194
    • Wallace, C.S.1    Boulton, D.M.2
  • 17
    • 0018015137 scopus 로고
    • Mode ling by shortest data description
    • J. Rissanen, "Mode ling by shortest data description," Automatica, vol. 14, no. 5, pp. 465-471, 1978.
    • (1978) Automatica , vol.14 , Issue.5 , pp. 465-471
    • Rissanen, J.1
  • 18
    • 0001902056 scopus 로고
    • Three approaches to the quantitative definition of information
    • A. N. Kolmogorov, "Three approaches to the quantitative definition of information, " Problemy Peredachi Inform atsii, vol. 1, no. 1, pp. 3-11, 1965.
    • (1965) Problemy Peredachi Inform Atsii , vol.1 , Issue.1 , pp. 3-11
    • Kolmogorov, A.N.1
  • 19
    • 0014516784 scopus 로고
    • The information content of a multistate distribution
    • D. Boulton and C. Wallace, "The information content of a multistate distribution, " Journal of Theoretical Biology, vol. 23, no. 2, pp. 269-278, 1969.
    • (1969) Journal of Theoretical Biology , vol.23 , Issue.2 , pp. 269-278
    • Boulton, D.1    Wallace, C.2
  • 20
    • 31344466989 scopus 로고    scopus 로고
    • Maximal subtriangulation in pre-processing phylogenetic data
    • A. Berry, A. Sigayret, and C. Sinoquet, "Maximal subtriangulation in pre-processing phylogenetic data, " Soft Computi ng, vol. 10, no. 5, pp. 461-468, 2006.
    • (2006) Soft Computing , vol.10 , Issue.5 , pp. 461-468
    • Berry, A.1    Sigayret, A.2    Sinoquet, C.3
  • 21
    • 26944470512 scopus 로고    scopus 로고
    • Screening and interpreting multi-item associations based on log-linear modeling
    • X. Wu, D. Barbará , and Y. Ye, " Screening and interpreting multi-item associations based on log-linear modeling," in Int. Conf. on Knowledge Disc. and Data Mining, 2003, pp. 276-285.
    • (2003) Int. Conf. on Knowledge Disc. and Data Mining , pp. 276-285
    • Wu, X.1    Barbará, D.2    Ye, Y.3
  • 22
    • 77953243531 scopus 로고    scopus 로고
    • Decomposition and model selection for large contingency tables
    • C. Dahinden,M. Kalisch,P. Bühlmann Decomposition and model selection for large contingency tables Biometrical Journal 52, 2, 233-252, 2010
    • (2010) Biometrical Journal , vol.52 , Issue.2 , pp. 233-252
    • Dahinden, C.1    Kalisch, M.2    Bühlmann, P.3


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