메뉴 건너뛰기




Volumn 4 LNICST, Issue PART 1, 2009, Pages 1167-1177

Classification based on the optimal K-associated network

Author keywords

Complex network; Data classification; Data mining; Network formation

Indexed keywords

CLASSIFICATION ALGORITHM; CLASSIFICATION TASKS; COMPLEX NETWORKS; DATA CLASS; DATA CLASSIFICATION; DATA SAMPLE; EXPERIMENTAL EVALUATION; GRAPH-BASED; MODEL-BASED OPC; MODELING DATA; NETWORK CAPTURE; NETWORK FORMATION; NOISY DATA; TOPOLOGICAL STRUCTURE; TRAINING DATA;

EID: 84885887319     PISSN: 18678211     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-02466-5_117     Document Type: Conference Paper
Times cited : (9)

References (17)
  • 1
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • DOI 10.1038/30918
    • Watts, D.J., Strogatz, S.H.: Collective Dynamics of 'Small-World' Networks. Nature 393, 440-442 (1998) (Pubitemid 28292183)
    • (1998) Nature , vol.393 , Issue.6684 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 2
    • 0033539175 scopus 로고    scopus 로고
    • Diameter of the world wide web
    • Albert, R., Jeong, H., Barabási, A.-L.: Diameter of the World Wide Web. Nature 401, 130-131 (1999)
    • (1999) Nature , vol.401 , pp. 130-131
    • Albert, R.1    Jeong, H.2    Barabási, A.-L.3
  • 3
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167-256 (2003)
    • (2003) SIAM Review , vol.45 , Issue.2 , pp. 167-256
    • Newman, M.E.J.1
  • 11
    • 0032686723 scopus 로고    scopus 로고
    • Chameleon: Hierarchical clustering using dynamic modeling
    • Karypis, G., Han, E.-H., Kumar, V.: Chameleon: Hierarchical Clustering using Dynamic Modeling. IEEE Computer 32(8), 68-75 (1999)
    • (1999) IEEE Computer , vol.32 , Issue.8 , pp. 68-75
    • Karypis, G.1    Han, E.-H.2    Kumar, V.3
  • 12
    • 0032091595 scopus 로고    scopus 로고
    • CURE: An efficient clustering algorithm for large databases
    • Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: Proc. of 1998 ACM-SIGMOD Int. Conf. on Management of Data, pp. 73-84 (1998) (Pubitemid 128655958)
    • (1998) SIGMOD Record , vol.27 , Issue.2 , pp. 73-84
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 13
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Physical Review E 69, 026113(1-15) (2004)
    • (2004) Physical Review e , vol.69 , Issue.1-15 , pp. 026113
    • Newman, M.E.J.1    Girvan, M.2
  • 17
    • 84885893398 scopus 로고    scopus 로고
    • University of California, School of Information and Computer Science, Irvine, CA
    • Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
    • (2007)
    • Asuncion, A.1    Newman, D.J.2


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