Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Neighborhood construction-based multi-objective evolutionary clustering algorithm with feature selection
Download
index.pdf
Date
2018
Author
Alakuş, Cansu
Metadata
Show full item record
Item Usage Stats
148
views
56
downloads
Cite This
In this study, we address the clustering problem with unknown number of clusters having arbitrary shapes, intracluster and/or intercluster density differences, no outliers or noise. The data set may be high-dimensional with a number of redundant features. This study consists of two parts. In the first part, we propose a multi-objective evolutionary clustering algorithm, namely MOCNC, with three fundamental objectives of the clustering problem: compactness, separation, and connectivity. We use the multi-objective framework and nondominated sorting property of the well-known evolutionary algorithm NSGA-II to simultaneously optimize the compactness and separation objectives. To handle the connectivity objective, a special Neighborhood Construction (NC) algorithm is used as a preprocessor. In the second part, we extend the MOCNC algorithm as MOCNC-F for the feature selection problem where the data sets may contain an unknown number of redundant features. In this algorithm, different subsets of features are selected in solutions and clustering is performed using the selected features. The output of MOCNC-F is a set of nondominated clustering solutions each with different compactness and separation values, and possibly with different feature subsets. Our algorithms are unique in that they solve the feature selection and clustering problem simultaneously using the three fundamental objectives, which are compactness, separation, and connectivity, explicitly. The proposed algorithms do not need any user-defined problem parameters. We have experimented with the algorithms on generated and benchmark data sets, and obtained promising results based on selected performance criteria.
Subject Keywords
Data mining.
,
Evolutionary algorithm.
,
Multi-objective clustering.
URI
http://etd.lib.metu.edu.tr/upload/12622375/index.pdf
https://hdl.handle.net/11511/27596
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Fuzzy versus statistical linear regression
Kim, KJ; Moskowitz, H; Köksalan, Mustafa Murat (1996-07-19)
Statistical linear regression and fuzzy linear regression have been developed from different perspectives, and thus there exist several conceptual and methodological differences between the two approaches. The characteristics of both methods, in terms of basic assumptions, parameter estimation, and application are described and contrasted. Their descriptive and predictive capabilities are also compared via a simulation experiment to identify the conditions under which one outperforms the other. It turns out...
Shape similarity measurement for boundary based features
Arica, N; Yarman Vural, Fatoş Tunay (2005-01-01)
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), which maps 2-D shape information into a set of 1-D functions. Firstly, we adopt Dynamic Time Warping method to develop an efficient distance calculation scheme, which is consistent with the human visual system in perceiving shape similarity. Since the starting point of the representations may differ in shapes, the best corresponden...
Mixed integer programming and heuristics approaches for clustering with cluster-based feature selection
İyigün, Cem (null; 2019-10-20)
In this study, we work on a clustering problem where it is assumed that the features identifying the clusters may differ for each cluster. Number of clusters and number of relevant features in each cluster are given in advance. A centerbased clustering approach is proposed. Finding the cluster centers, assigning the data points and selecting relevant features for each cluster are performed simultaneously. A non-linear mixed integer mathematical model is proposed which minimizes the total distance between da...
Temporal clustering of time series via threshold autoregressive models: application to commodity prices
Aslan, Sipan; Yozgatlıgil, Ceylan; İyigün, Cem (2018-01-01)
The primary aim in this study is grouping time series according to the similarity between their data generating mechanisms (DGMs) rather than comparing pattern similarities in the time series trajectories. The approximation to the DGM of each series is accomplished by fitting the linear autoregressive and the non-linear threshold autoregressive models, and outputs of the estimates are used for feature extraction. Threshold autoregressive models are recognized for their ability to represent nonlinear feature...
Reconfigurable UKF for in-flight magnetometer calibration and attitude parameter estimation
Söken, Halil Ersin (2011-01-01)
In this study a reconfigurable unscented Kalman filter (UKF) based algorithm for the estimation of magnetometer biases and scale factors is proposed as a part of the attitude estimation scheme of a pico satellite. Algorithm is composed of two stages; in first stage UKF estimates magnetometer biases and scale factors as well as six attitude parameters of the satellite. Differently from the existing algorithms, scale factors are not treated together with the other parameters as a part of the state vector; thr...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Alakuş, “Neighborhood construction-based multi-objective evolutionary clustering algorithm with feature selection,” M.S. - Master of Science, Middle East Technical University, 2018.