Heuristic Clustering Based on Centroid Learning and Cognitive Feature Capturing
نویسندگان
چکیده
منابع مشابه
Clustering Based Feature Learning on Variable Stars
The success of automatic classification of variable stars strongly depends on the lightcurve representation. Usually, lightcurves are represented as a vector of many statistical descriptors designed by astronomers called features. These descriptors commonly demand significant computational power to calculate, require substantial research effort to develop and do not guarantee good performance o...
متن کاملHeuristic Methods for Large Centroid Clustering Problems 1
This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and...
متن کاملImproving fuzzy c-means clustering based on feature-weight learning
Feature-weight assignment can be regarded as a generalization of feature selection. That is, if all values of featureweights are either 1 or 0, feature-weight assignment degenerates to the special case of feature selection. Generally speaking, a number in 1⁄20; 1 can be assigned to a feature for indicating the importance of the feature. This paper shows that an appropriate assignment of feature...
متن کاملDiagnosis of Heart Disease Based on Meta Heuristic Algorithms and Clustering Methods
Data analysis in cardiovascular diseases is difficult due to large massive of information. All of features are not impressive in the final results. So it is very important to identify more effective features. In this study, the method of feature selection with binary cuckoo optimization algorithm is implemented to reduce property. According to the results, the most appropriate classification fo...
متن کاملAttribute Clustering Based on Heuristic Tree Partition
Attribute clustering has been previously employed to detect statistical dependence between subsets of variables. Clusters of variables can be appropriately used for detecting highly dependent domain variables and then reducing the complexity of learning Bayesian networks. We propose a novel attribute clustering algorithm motivated by research of complex networks, called the Star Discovery algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2019
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2019/1530618