See this document in CiteSeerX!

Improving the Orthogonal Range Search k-windows Algorithm (2002)  (Make Corrections)  
P. Alevizos, et al.



  Home/Search   Context   Related

 
View or download:
math.upatras.gr/~d...levizosVTV2002.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  math.upatras.gr...ublications.php (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Clustering, that is the partitioning of a set of patterns into disjoint and homogeneous meaningful groups (clusters) , is a fundamental process in the practice of science. k-windows is an efficient clustering algorithm that reduces the number of patterns that need to be examined for similarity, using a windowing technique. It is based on well known spatial data structures, namely the range tree, that allows fast range searches. From a theoretical standpoint, the k- windows algorithm has a lower ... (Update)

Active bibliography (related documents):   More   All
0.5:   QROCK: A Quick Version of the ROCK Algorithm for.. - Dutta, Mahanta, Pujari   (Correct)
0.4:   Parallel Unsupervised k-Windows: An Efficient.. - Tasoulis.. (2003)   (Correct)
0.4:   Parallelizing the Unsupervised k-Windows Clustering.. - Alevizos, Tasoulis..   (Correct)

Similar documents based on text:   More   All
0.4:   Optimization Strategies And Backpropagation Neural Networks - Plagianakos, Magoulas, al.   (Correct)
0.4:   Improving the Convergence of the Backpropagation Algorithm.. - Magoulas, al. (1999)   (Correct)
0.3:   Sign-methods for Training with Imprecise Error Function .. - Magoulas, Plagianakos, ..   (Correct)

BibTeX entry:   (Update)

@misc{ alevizos-improving,
  author = "P. Alevizos and et al.",
  title = "Improving the Orthogonal Range Search k-windows Algorithm",
  url = "citeseer.ist.psu.edu/alevizos02improving.html" }
Citations (may not include all citations):
805   Algorithms for Clustering Data (context) - Jain, Dubes - 1988
508   Computational Geometry (context) - Preparata, Shamos - 1985
242   Efficient and Effective Clustering Methods for Spatial Data .. - Ng, Han - 1994
222   BIRCH: An Efficient Data Clustering Method for Very Large Da.. - Zhang, Ramakrishnan et al. - 1996
210   A densitybased algorithm for discovering clusters in large s.. - Ester, Kriegel et al. - 1996
197   Cluster Analysis for Applications (context) - Anderberg - 1973
111   Scaling Clustering Algorithms to Large Databases - Bradley, Fayyad et al. - 1998
69   Filtering Search: A new approach to query-answering (context) - Chazelle - 1986
56   CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic.. - Karyapis, Han et al.
33   Clustering methodologies in exploratory data analysis (context) - Dubes, Jain - 1980
29   DensityBased Clustering in Spatial Databases: The Algorithm .. (context) - Sander, Ester et al. - 1998
25   Fractional Cascading: II (context) - Chazelle, Guibas - 1986
19   Cluster Analysis (context) - Aldenderfer, Blashfield - 1984
12   windows Algorithm for Improving the k-means Clustering Algor.. (context) - Vrahatis, Boutsinas et al. - 2002
9   Parallel clustering algorithms (context) - Li, Fang - 1989
3   An Algorithm for Orthogonal Range Search in d 3 dimensions (context) - Alevizos - 1998
2   CURE: An efficient algorithm for clustering large databases (context) - Guha, Rastogi et al. - 1998
1   Analysis of Normal and Pathological Fetal Magnetocardiograms.. (context) - Adamopoulos, Boutsinas et al. - 2001
1   On Distributing the Clustering Process (context) - Boutsinas, Gnardellis - 2002

Documents on the same site (http://www.math.upatras.gr/~dtas/publications.php):   More
Multiobjective Optimization Using Parallel Vector.. - Parsopoulos.. (2004)   (Correct)
Unsupervised Distributed Clustering - Tasoulis, Vrahatis (2004)   (Correct)
Parallelizing the Unsupervised k-Windows Clustering.. - Alevizos, Tasoulis..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC