On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

2020 ◽  
pp. 46-52
Author(s):  
Alexander Kel’manov ◽  
Vladimir Khandeev
Keyword(s):  
Clustering Problem ◽  
Polynomial Solvability

On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

2019 ◽  
Vol 100 (1) ◽  
pp. 339-342
Author(s):  
A. V. Kel’manov ◽  
V. I. Khandeev
Keyword(s):  
Clustering Problem ◽  
Polynomial Solvability

Multi-Start Jaya Algorithm for Software Module Clustering Problem

2018 ◽  
Vol 1 (1) ◽  
pp. 87-112 ◽  
Author(s):  
Kamal Z. Zamli ◽  
◽  
Abdulrahman Alsewari ◽  
Bestoun S. Ahmed ◽  
◽  
...  
Keyword(s):  
Jaya Algorithm ◽  
Software Module ◽  
Clustering Problem ◽  
Software Module Clustering

An Improved B-hill Climbing Optimization Technique for Solving the Text Documents Clustering Problem

2020 ◽  
Vol 16 (4) ◽  
pp. 296-306 ◽  
Author(s):  
Laith Mohammad Abualigah ◽  
Essam Said Hanandeh ◽  
Ahamad Tajudin Khader ◽  
Mohammed Abdallh Otair ◽  
Shishir Kumar Shandilya
Keyword(s):  
Optimization Technique ◽  
Document Clustering ◽  
Text Clustering ◽  
Hill Climbing ◽  
Text Documents ◽  
Clustering Problem ◽  
Text Document ◽  
Text Information ◽  
Amount Of Knowledge ◽  
The Hill

Background: Considering the increasing volume of text document information on Internet pages, dealing with such a tremendous amount of knowledge becomes totally complex due to its large size. Text clustering is a common optimization problem used to manage a large amount of text information into a subset of comparable and coherent clusters. Aims: This paper presents a novel local clustering technique, namely, β-hill climbing, to solve the problem of the text document clustering through modeling the β-hill climbing technique for partitioning the similar documents into the same cluster. Methods: The β parameter is the primary innovation in β-hill climbing technique. It has been introduced in order to perform a balance between local and global search. Local search methods are successfully applied to solve the problem of the text document clustering such as; k-medoid and kmean techniques. Results: Experiments were conducted on eight benchmark standard text datasets with different characteristics taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed β-hill climbing achieved better results in comparison with the original hill climbing technique in solving the text clustering problem. Conclusion: The performance of the text clustering is useful by adding the β operator to the hill climbing.

scholarly journals An Elite Adaptive Niche Evolutionary Algorithm for Duty Clustering Problem in SoWSN

2021 ◽  
Vol 1769 (1) ◽  
pp. 012067
Author(s):  
Jinbin Bai ◽  
Min Tian ◽  
Jiangquan Li
Keyword(s):  
Evolutionary Algorithm ◽  
Clustering Problem

scholarly journals Clustering of cancer data based on Stiefel manifold for multiple views

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Jing Tian ◽  
Jianping Zhao ◽  
Chunhou Zheng
Keyword(s):  
Optimization Problem ◽  
Nearest Neighbor ◽  
Search Algorithm ◽  
Stiefel Manifold ◽  
Omics Data ◽  
K Nearest Neighbor ◽  
Cancer Data ◽  
Clustering Problem ◽  
Multiple Datasets ◽  
Cluster Class

Abstract Background In recent years, various sequencing techniques have been used to collect biomedical omics datasets. It is usually possible to obtain multiple types of omics data from a single patient sample. Clustering of omics data plays an indispensable role in biological and medical research, and it is helpful to reveal data structures from multiple collections. Nevertheless, clustering of omics data consists of many challenges. The primary challenges in omics data analysis come from high dimension of data and small size of sample. Therefore, it is difficult to find a suitable integration method for structural analysis of multiple datasets. Results In this paper, a multi-view clustering based on Stiefel manifold method (MCSM) is proposed. The MCSM method comprises three core steps. Firstly, we established a binary optimization model for the simultaneous clustering problem. Secondly, we solved the optimization problem by linear search algorithm based on Stiefel manifold. Finally, we integrated the clustering results obtained from three omics by using k-nearest neighbor method. We applied this approach to four cancer datasets on TCGA. The result shows that our method is superior to several state-of-art methods, which depends on the hypothesis that the underlying omics cluster class is the same. Conclusion Particularly, our approach has better performance than compared approaches when the underlying clusters are inconsistent. For patients with different subtypes, both consistent and differential clusters can be identified at the same time.

scholarly journals A “maximum node clustering” problem

2006 ◽  
Author(s):  
Giuliana Carello ◽  
Federico Della Croce ◽  
Andrea Grosso ◽  
Marco Locatelli
Keyword(s):  
Clustering Problem ◽  
Node Clustering

Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents

2010 ◽  
Vol 24 (3) ◽  
pp. 1117-1136 ◽  
Author(s):  
Deeparnab Chakrabarty ◽  
Nikhil R. Devanur ◽  
Vijay V. Vazirani
Keyword(s):  
Polynomial Solvability ◽  
Two Agents ◽  
Strongly Polynomial

CLUSTERING USING AN IMPROVED HYBRID GENETIC ALGORITHM

2007 ◽  
Vol 16 (06) ◽  
pp. 919-934
Author(s):  
YONGGUO LIU ◽  
XIAORONG PU ◽  
YIDONG SHEN ◽  
ZHANG YI ◽  
XIAOFENG LIAO
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Sum Of Squares ◽  
Clustering Methods ◽  
Clustering Problem ◽  
Mutation Operation ◽  
Iteration Methods ◽  
Genetic Clustering ◽  
The Individual

In this article, a new genetic clustering algorithm called the Improved Hybrid Genetic Clustering Algorithm (IHGCA) is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. In IHGCA, the improvement operation including five local iteration methods is developed to tune the individual and accelerate the convergence speed of the clustering algorithm, and the partition-absorption mutation operation is designed to reassign objects among different clusters. By experimental simulations, its superiority over some known genetic clustering methods is demonstrated.

Sign in / Sign up

Export Citation Format

Share Document