메뉴 건너뛰기




Volumn 21, Issue 2, 2010, Pages 293-309

Using background knowledge to rank itemsets

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL KNOWLEDGE; BACKGROUND KNOWLEDGE; FREQUENCY PREDICTION; INDEPENDENCE MODELS; ITEM SETS; MAXIMUM ENTROPY; MAXIMUM ENTROPY MODELS; OPEN PROBLEMS; POLYNOMIAL-TIME;

EID: 77958060227     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0188-4     Document Type: Conference Paper
Times cited : (27)

References (21)
  • 6
    • 0000546609 scopus 로고
    • I-divergence geometry of probability distributions andminimization problems
    • Csiszár I (1975) I-divergence geometry of probability distributions andminimization problems. Ann Probab 3(1):146-158
    • (1975) Ann Probab , vol.3 , Issue.1 , pp. 146-158
    • Csiszár, I.1
  • 7
    • 0001573124 scopus 로고
    • Generalized iterative scaling for log-linear models
    • Darroch J, RatcliffD (1972) Generalized iterative scaling for log-linear models.Ann Math Stat 43(5):1470-1480
    • (1972) Ann Math Stat , vol.43 , Issue.5 , pp. 1470-1480
    • Darroch, J.1    Ratcliff, D.2
  • 12
    • 12244313033 scopus 로고    scopus 로고
    • Interestingness of frequent itemsets using Bayesian networks as background knowledge. In: KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
    • New York
    • Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using Bayesian networks as background knowledge. In: KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, pp 178-186
    • (2004) ACM , pp. 178-186
    • Jaroszewicz, S.1    Simovici, D.A.2
  • 13
    • 0001880210 scopus 로고    scopus 로고
    • KDD-Cup 2000 organizers' report: Peeling the onion
    • Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z (2000) KDD-Cup 2000 organizers' report: peeling the onion. SIGKDD Explor 2(2):86-98. http://www.ecn.purdue.edu/KDDCUP
    • (2000) SIGKDD Explor , vol.2 , Issue.2 , pp. 86-98
    • Kohavi, R.1    Brodley, C.2    Frasca, B.3    Mason, L.4    Zheng, Z.5
  • 15
    • 0001754925 scopus 로고    scopus 로고
    • Theory of dependence values
    • Meo R (2000) Theory of dependence values. ACM Trans Database Syst 25(3):380-406
    • (2000) ACM Trans Database Syst , vol.25 , Issue.3 , pp. 380-406
    • Meo, R.1
  • 18
    • 0000120766 scopus 로고
    • Estimating the dimension of a model
    • Schwarz G (1978) Estimating the dimension of a model. Ann Stat 6(2):461-464
    • (1978) Ann Stat , vol.6 , Issue.2 , pp. 461-464
    • Schwarz, G.1
  • 19
    • 33645682623 scopus 로고    scopus 로고
    • Safe projections of binary data sets
    • Tatti N (2006) Safe projections of binary data sets. Acta Inf 42(8-9):617-638
    • (2006) Acta Inf , vol.42 , Issue.8-9 , pp. 617-638
    • Tatti, N.1
  • 20
    • 54049104046 scopus 로고    scopus 로고
    • Maximum entropy based significance of itemsets
    • Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1):57-77
    • (2008) Knowl Inf Syst , vol.17 , Issue.1 , pp. 57-77
    • Tatti, N.1
  • 21
    • 0033718951 scopus 로고    scopus 로고
    • Scalable algorithms for association mining
    • Zaki JZ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372-390
    • (2008) IEEE Trans Knowl Data Eng , vol.12 , Issue.3 , pp. 372-390
    • Zaki, J.Z.1


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