지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2008.10
- 수록면
- 2,298 - 2,303 (6page)
이용수
초록· 키워드
오류제보하기
This paper proposes a multi-objective evolution strategy (ES) hybridized with a k-means algorithm to address a data clustering problem whose objective is minimizing both clustering error and cluster number. Contrary to the conventional data clustering problem with a predetermined number of clusters, the bi-objective problem considered in this study has a set of clustering solutions whose cluster numbers are different from one another. This enables to secure the best clustering result that fits specific needs without restricting the cluster number. To find the solution set, the hybrid ES evolves a population of solution candidates each of which represents a variable number of cluster centroids. While evolving the population, special ES operators dedicated to the bi-objective clustering problem are used. Whenever the hybrid ES creates a new set of cluster centroids, it is fine-tuned by the k-means algorithm. The experiment results show that the hybrid ES outperforms the conventional ES and KMA.
목차
Abstract
1. INTRODUCTION
2. PREVIOUSWORKS
3. PROBLEM FORMULATION
4. HYBRID EVOLUTION STRATEGY
5. EXPERIMENTAL RESULTS
6. CONCLUSIONS
REFERENCES
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Empirical Comparisons of Clustering Algorithms using Silhouette Information
INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS
2010 .03
-
K-means based Cluster ing Method with a Fixed Number of Cluster Members
멀티미디어학회논문지
2014 .10
-
Synthesis of clustering algorithms based on selection of centroids
제어로봇시스템학회 국제학술대회 논문집
2018 .10
-
The Evaluation Measure of Text Clustering for the Variable Number of Clusters
한국정보과학회 학술발표논문집
2006 .10
-
데이터 레코드의 Clustering Algorithms
(구)정보과학회논문지
1978 .12
-
Support Vector Data Description Using Clustering Method
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2007 .07
-
Fast Super-Resolution Algorithm Based on Dictionary Size Reduction Using k-Means Clustering
[ETRI] ETRI Journal
2010 .08
-
테이터 레코드의 Clustering Algorithms
한국정보과학회 학술발표논문집
1978 .10
-
Optimization-Based Data Clustering Algorithm
대한산업공학회 춘계공동학술대회 논문집
2007 .05
-
The Effect of Bias in Data Set for Conceptual Clustering Algorithms
International journal of advanced smart convergence
2019 .01
-
Selection of Cluster Topic Words in Hierarchical Clustering using K-Means Algorithm
ICEIC : International Conference on Electronics, Informations and Communications
2004 .08
-
Nearest neighbor and validity-based clustering
INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS
2004 .12
-
About one clustering algorithm in intellectual data analysis
ICEIC : International Conference on Electronics, Informations and Communications
2008 .06
-
합성곱 오토인코더 기반의 응집형 계층적 군집 분석
멀티미디어학회논문지
2020 .01
-
Exponential Probability Clustering
대한전자공학회 학술대회
2008 .06
-
Automatic Determination of the Number of Clusters for Semi-Supervised Relational Fuzzy Clustering
INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS
2020 .06
-
CLUSTER VALIDITY ANALYSIS FOR FLOOD CLUSTERING
한국수자원학회 학술발표회
2005 .01
-
A Cluster Validity Index for Fuzzy Clustering
한국지능시스템학회 논문지
1999 .12
-
Repeated Clustering to Improve the Discrimination of Typical Daily Load Profile
Journal of Electrical Engineering & Technology
2012 .05
-
Study on Clustering of Satellite Images by K-Means Algorithm
한국통신학회 학술대회논문집
1987 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-569-000976962