Interactive \(K\)-means clustering method based on user behavior for different analysis target in medicine (Q1784131)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interactive \(K\)-means clustering method based on user behavior for different analysis target in medicine |
scientific article; zbMATH DE number 6943937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interactive \(K\)-means clustering method based on user behavior for different analysis target in medicine |
scientific article; zbMATH DE number 6943937 |
Statements
Interactive \(K\)-means clustering method based on user behavior for different analysis target in medicine (English)
0 references
26 September 2018
0 references
Summary: Clustering algorithm as a basis of data analysis is widely used in analysis systems. However, as for the high dimensions of the data, the clustering algorithm may overlook the business relation between these dimensions especially in the medical fields. As a result, usually the clustering result may not meet the business goals of the users. Then, in the clustering process, if it can combine the knowledge of the users, that is, the doctor's knowledge or the analysis intent, the clustering result can be more satisfied. In this paper, we propose an interactive \(K\)-means clustering method to improve the user's satisfactions towards the result. The core of this method is to get the user's feedback of the clustering result, to optimize the clustering result. Then, a particle swarm optimization algorithm is used in the method to optimize the parameters, especially the weight settings in the clustering algorithm to make it reflect the user's business preference as possible. After that, based on the parameter optimization and adjustment, the clustering result can be closer to the user's requirement. Finally, we take an example in the breast cancer, to testify our method. The experiments show the better performance of our algorithm.
0 references
\(K\)-means clustering
0 references
user behavior
0 references
medicine
0 references