메뉴 건너뛰기




Volumn 16, Issue 7, 2006, Pages 2073-2079

Unsupervised clustering using fractal dimension

Author keywords

Cluster analysis; Clustering within clusters; Fractal dimension; Unsupervised clustering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; FRACTALS; REAL TIME SYSTEMS;

EID: 33748531303     PISSN: 02181274     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021812740601591X     Document Type: Article
Times cited : (13)

References (32)
  • 1
    • 0004190826 scopus 로고
    • Quantitative Applications in the Social Sciences (SAGE Publications, London)
    • Aldenderfer, M. S. & Blashfield, R. K. [1984] Cluster Analysis, Quantitative Applications in the Social Sciences, Vol. 44 (SAGE Publications, London).
    • (1984) Cluster Analysis , vol.44
    • Aldenderfer, M.S.1    Blashfield, R.K.2
  • 3
    • 0034592785 scopus 로고    scopus 로고
    • Using the fractal dimension to cluster datasets
    • ACM Press
    • Barbarä, D. & Chen, P. [2000] "Using the fractal dimension to cluster datasets," Knowledge Discovery in Databases (ACM Press), pp. 260-264.
    • (2000) Knowledge Discovery in Databases , pp. 260-264
    • Barbarä, D.1    Chen, P.2
  • 5
    • 0019173421 scopus 로고
    • Efficient worst-case data structures for range searching
    • Bentley, J. L. & Maurer, H. A. [1980] "Efficient worst-case data structures for range searching," Acta Inform. 13, 155-168.
    • (1980) Acta Inform. , vol.13 , pp. 155-168
    • Bentley, J.L.1    Maurer, H.A.2
  • 7
    • 22644451496 scopus 로고    scopus 로고
    • Principal direction divisive partitioning
    • Boley, D. [1998] "Principal direction divisive partitioning," Data Min. Knowl. Discov. 2, 325-344.
    • (1998) Data Min. Knowl. Discov. , vol.2 , pp. 325-344
    • Boley, D.1
  • 8
    • 33748522292 scopus 로고    scopus 로고
    • Catalogue, Earthquake, Institute of Geodynamics, National Observatory of Athens
    • Catalogue, Earthquake, http://www.gein.noa.gr/services/cat.html, Institute of Geodynamics, National Observatory of Athens.
  • 9
    • 0022767762 scopus 로고
    • Filtering search: A new approach to query-answering
    • Chazelle, B. [1986] "Filtering search: A new approach to query-answering," SIAM J. Comput. 15, 703-724.
    • (1986) SIAM J. Comput. , vol.15 , pp. 703-724
    • Chazelle, B.1
  • 10
    • 0034824884 scopus 로고    scopus 로고
    • Concept decompositions for large sparse text data using clustering
    • Dhillon, I. S. & Modha, D. S. [2001] "Concept decompositions for large sparse text data using clustering," Mach. Learn. 42, 143-175.
    • (2001) Mach. Learn. , vol.42 , pp. 143-175
    • Dhillon, I.S.1    Modha, D.S.2
  • 13
    • 33646981873 scopus 로고
    • Characterization of strange attractors
    • Grassberg, P. & Procaccia, I. [1983] "Characterization of strange attractors," Phys. Rev. Lett. 50, 346-349.
    • (1983) Phys. Rev. Lett. , vol.50 , pp. 346-349
    • Grassberg, P.1    Procaccia, I.2
  • 14
    • 0000442068 scopus 로고
    • A fast algorithm to determine fractal dimensions by box counting
    • Liebovitch, L. S. & Toth, T. [1989] "A fast algorithm to determine fractal dimensions by box counting," Phys. Lett. A 141, 386-390.
    • (1989) Phys. Lett. A , vol.141 , pp. 386-390
    • Liebovitch, L.S.1    Toth, T.2
  • 18
    • 70349406797 scopus 로고    scopus 로고
    • Financial forecasting through unsupervised clustering and evolutionary trained neural networks
    • Pavlidis, N. G., Tasoulis, D. K. & Vrahatis, M. N. [2003] "Financial forecasting through unsupervised clustering and evolutionary trained neural networks," Congress on Evolutionary Computation, pp. 2314-2321.
    • (2003) Congress on Evolutionary Computation , pp. 2314-2321
    • Pavlidis, N.G.1    Tasoulis, D.K.2    Vrahatis, M.N.3
  • 22
    • 0026828784 scopus 로고
    • Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
    • Ramasubramanian, V. & Paliwal, K. [1992] "Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding," IEEE Trans. Sign. Process. 40, 518-531.
    • (1992) IEEE Trans. Sign. Process. , vol.40 , pp. 518-531
    • Ramasubramanian, V.1    Paliwal, K.2
  • 24
    • 0026927227 scopus 로고
    • An efficient approach to estimate fractal dimension of textural images
    • Sarkar, N. & Chaudhuri, B. B. [1992] "An efficient approach to estimate fractal dimension of textural images," Patt. Recogn. 25, 1035-1041.
    • (1992) Patt. Recogn. , vol.25 , pp. 1035-1041
    • Sarkar, N.1    Chaudhuri, B.B.2
  • 29
    • 24344491523 scopus 로고    scopus 로고
    • Unsupervised clustering on dynamic databases
    • Tasoulis, D. K. & Vrahatis, M. N. [2005] "Unsupervised clustering on dynamic databases," Patt. Recogn. Lett. 26, 2116-2127.
    • (2005) Patt. Recogn. Lett. , vol.26 , pp. 2116-2127
    • Tasoulis, D.K.1    Vrahatis, M.N.2
  • 31
    • 0004185855 scopus 로고
    • Edward Brothers, Ann Arbor, MI
    • Tryon, C. [1939] Cluster Analysis (Edward Brothers, Ann Arbor, MI).
    • (1939) Cluster Analysis
    • Tryon, C.1
  • 32
    • 0036230457 scopus 로고    scopus 로고
    • The new k-windows algorithm for improving the k-means clustering algorithm
    • Vrahatis, M. N., Boutsinas, B., Alevizos, P. & Pavlides, G. [2002] "The new k-windows algorithm for improving the k-means clustering algorithm," J. Compl. 18, 375-391.
    • (2002) J. Compl. , vol.18 , pp. 375-391
    • Vrahatis, M.N.1    Boutsinas, B.2    Alevizos, P.3    Pavlides, G.4


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