Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.  

The (k-)nearest neighbor searching has very high computational costs. The algorithms presented for nearest neighbor search in high dimensional spaces have have suffered from curse of dimensionality, which affects either runtime or storage requirements of the algorithms terribly. Parallelization of nearest neighbor search is a suitable solution for decreasing the workload caused by nearest neigh...

In a large software system knowing which files are most likely to be fault-prone is valuable information for project managers. They can use such information in prioritizing software testing and allocating resources accordingly. However, our experience shows that it is difficult to collect and analyze finegrained test defects in a large and complex software system. On the other hand, previous re...

In this paper, a new algorithm is developed to reduce the computational complexity of Ward’s method. The proposed approach uses a dynamic k-nearest-neighbor list to avoid the determination of a cluster’s nearest neighbor at some steps of the cluster merge. Double linked algorithm (DLA) can significantly reduce the computing time of the fast pairwise nearest neighbor (FPNN) algorithm by obtainin...

abstract saturated hydraulic conductivity (ks) is needed for many studies related to water and solute transport, but often cannot be measured because of practical and/or cost-related reasons. nonparametric approaches are being used in various fields to estimate continuous variables. one type of the nonparametric lazy learning algorithms, a k-nearest neighbor (k-nn) algorithm, was introduced and...

kernel density estimators are the basic tools for density estimation in non-parametric statistics.  the k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in  which  the  bandwidth  is varied depending on the location of the sample points. in this paper‎, we  initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...

Combining Fourier transform infrared spectroscopy (FTIR) with endoscopy, it is expected that noninvasive, rapid detection of colorectal cancer can be performed in vivo in the future. In this study, Fourier transform infrared spectra were collected from 88 endoscopic biopsy colorectal tissue samples (41 colitis and 47 cancers). A new method, viz., entropy weight local-hyperplane k-nearest-neighb...

The k-nearest neighbor query in multidimensional index structures is one of the most frequently used query types in multimedia databases and geographic information systems. Until now, most of the analytic models are restricted to a particular type of the index structure, for example, the R-Tree and they concentrate on the analysis of the range query. Recently, a cost model [3] was reported for ...

Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees could be used for efficient nearest neighbor classification. The presented algorithm is simple and finds the nearest neighbor in a logarithmic order. It performs d log n + k distance measures to find the nearest neighbor, where k is a constant that is much ...

We introduce a new approach for predicting the secondary structure of proteins using profiles and the Fuzzy K-Nearest Neighbor algorithm. K-Nearest Neighbor methods give relatively better performance than Neural Networks or Hidden Markov models when the query protein has few homologs in the sequence database to build sequence profile. Although the traditional K-Nearest Neighbor algorithms are a...