메뉴 건너뛰기




Volumn 15, Issue 1, 2007, Pages 87-97

Future trends in data mining

Author keywords

Data Mining; Future trends; Knowledge discovery

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES;

EID: 34547275841     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-007-0067-9     Document Type: Article
Times cited : (116)

References (32)
  • 2
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • 1-3
    • Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337(1-3):217-239
    • (2005) Theor Comput Sci , vol.337 , pp. 217-239
    • Bille, P.1
  • 4
    • 2342646842 scopus 로고    scopus 로고
    • LSimpute: Accurate estimation of missing values in microarray data with least squares methods
    • Bø TH, Dysvik B, Jonassen I (2004) LSimpute: accurate estimation of missing values in microarray data with least squares methods. Nucleic Acids Res 32(3)
    • (2004) Nucleic Acids Res , vol.32 , Issue.3
    • Bø, T.H.1
  • 5
    • 14544300820 scopus 로고    scopus 로고
    • Computing clusters of correlation connected objects
    • Paris, France
    • Böhm C, Kailing K, Kröger P, Zimek A (2004) Computing clusters of correlation connected objects. In: Proceedings of the SIGMOD conference, Paris, France, pp 455-466
    • (2004) Proceedings of the SIGMOD Conference , pp. 455-466
    • Böhm, C.K.1
  • 6
    • 34547328227 scopus 로고    scopus 로고
    • The impact of preprocessing on data mining: An evaluation of classifier sensitivity in direct marketing
    • Cronea SF, Lessmann S, Stahlbock R (2005) The impact of preprocessing on data mining: an evaluation of classifier sensitivity in direct marketing. Eur J Oper Res
    • (2005) Eur J Oper Res
    • Cronea, S.F.1    Lessmann, S.2    Stahlbock, R.3
  • 7
    • 0030649484 scopus 로고    scopus 로고
    • Solving the multiple instance problem with axis-parallel rectangles
    • Dietterich TG, Lathrop RH, Lozano-Perez T (1997) Solving the multiple instance problem with axis-parallel rectangles. Artif Intell 89:31-71
    • (1997) Artif Intell , vol.89 , pp. 31-71
    • Dietterich, T.G.1    Lathrop, R.H.2    Lozano-Perez, T.3
  • 9
    • 0031338770 scopus 로고    scopus 로고
    • Distance measures for point sets and their computation
    • 2
    • Eiter T, Mannila H (1997) Distance measures for point sets and their computation. Acta Informatica 34(2):103-133
    • (1997) Acta Informatica , vol.34 , pp. 103-133
    • Eiter, T.1    Mannila, H.2
  • 13
    • 85134529789 scopus 로고    scopus 로고
    • Data integration: A status report
    • Halevy AY (2003) Data integration: a status report. In: BTW, pp 24-29
    • (2003) BTW , pp. 24-29
    • Halevy, A.Y.1
  • 15
    • 27944450456 scopus 로고    scopus 로고
    • DNA microarray data imputation and significance analysis of differential expression
    • 22
    • Jörnsten R, Wang H-Y, Welsh WJ, Ouyang M (2005) DNA microarray data imputation and significance analysis of differential expression. Bioinformatics 21(22):4155-4161
    • (2005) Bioinformatics , vol.21 , pp. 4155-4161
    • Jörnsten, R.1    Wang, H.-Y.2    Welsh, W.J.3    Ouyang, M.4
  • 17
    • 34547253402 scopus 로고    scopus 로고
    • Mining source code elements for comprehending object-oriented systems and evaluating their maintainability
    • 1
    • Kanellopoulos Y, Dimopulos T, Tjortjis C, Makris C (2006) Mining source code elements for comprehending object-oriented systems and evaluating their maintainability. SIGKDD Explorations 8(1):33-40
    • (2006) SIGKDD Explorations , vol.8 , pp. 33-40
    • Kanellopoulos, Y.1    Dimopulos, T.2    Tjortjis, C.3    Makris, C.4
  • 20
    • 2942564374 scopus 로고    scopus 로고
    • Using support vector machines for classifying large sets of multi-represented objects
    • Orlando, FL
    • Kriegel H-P, Kröger P, Pryakhin A, Schubert M (2004) Using support vector machines for classifying large sets of multi-represented objects. In: Proceedings of the 4th SIAM international conference on data mining (SDM), Orlando, FL, pp 102-113
    • (2004) Proceedings of the 4th SIAM International Conference on Data Mining (SDM) , pp. 102-113
    • Kriegel, H.-P.K.1
  • 27
    • 0035402326 scopus 로고    scopus 로고
    • A polynomial time computable metric between points sets
    • Ramon J, Bruynooghe M (2001) A polynomial time computable metric between points sets. Acta Informatica 37:765-780
    • (2001) Acta Informatica , vol.37 , pp. 765-780
    • Ramon, J.1    Bruynooghe, M.2
  • 31
    • 12244307653 scopus 로고    scopus 로고
    • State of the art of graph-based data mining
    • 1
    • Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explorations Newslett 5(1):59-68
    • (2003) SIGKDD Explorations Newslett , vol.5 , pp. 59-68
    • Washio, T.1    Motoda, H.2


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