Homogeneous Densities Clustering Algorithm
نویسندگان
چکیده
منابع مشابه
A clustering algorithm to find groups with homogeneous pre..
When we are learning people’s preferences the training material can be expressed as in regression problems: the description of each object is then followed by a number that assesses the degree of satisfaction. Alternatively, training examples can be represented by preference judgments: pairs of vectors (v, u) where someone expresses that he or she prefers v to u. Usually, obtaining preference i...
متن کاملClustering Distributed Homogeneous Datasets
In this paper we present an elegant and effective algorithm for measuring the similarity between homogeneous datasets to enable clustering. Once similar datasets are clustered, each cluster can be independently mined to generate the appropriate rules for a given cluster. The algorithm presented is efficient in storage and scale, has the ability to adjust to time constraints, and can provide the...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملMixtures of Radial Densities for Clustering Graphs
We address the problem of unsupervised learning on graphs. The contribution is twofold: (1) we propose an EM algorithm for estimating the parameters of a mixture of radial densities on graphs on the basis of the graph orbifold framework; and (2) we compare orbifold-based clustering algorithms including the proposed EM algorithm against stateof-the-art methods based on pairwise dissimilarities. ...
متن کاملTime series clustering based on forecast densities
A new clustering method for time series is proposed, based on the full probability density of the forecasts. First, a resampling method combined with a nonparametric kernel estimator provides estimates of the forecast densities. A measure of discrepancy is then defined between these estimates and the resulting dissimilarity matrix is used to carry out the required cluster analysis. Applications...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2018
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2018.10.01