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
Self-learning K-means clustering: a global optimization approach
Date
2013-06-01
Author
Volkovich, Z.
Toledano-Kitai, D.
Weber, Gerhard Wilhelm
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
41
views
0
downloads
Cite This
An appropriate distance is an essential ingredient in various real-world learning tasks. Distance metric learning proposes to study a metric, which is capable of reflecting the data configuration much better in comparison with the commonly used methods. We offer an algorithm for simultaneous learning the Mahalanobis like distance and K-means clustering aiming to incorporate data rescaling and clustering so that the data separability grows iteratively in the rescaled space with its sequential clustering. At each step of the algorithm execution, a global optimization problem is resolved in order to minimize the cluster distortions resting upon the current cluster configuration. The obtained weight matrix can also be used as a cluster validation characteristic. Namely, closeness of such matrices learned during a sample process can indicate the clusters readiness; i.e. estimates the true number of clusters. Numerical experiments performed on synthetic and on real datasets verify the high reliability of the proposed method.
Subject Keywords
Management Science and Operations Research
,
Control and Optimization
,
Applied Mathematics
,
Computer Science Applications
URI
https://hdl.handle.net/11511/56690
Journal
JOURNAL OF GLOBAL OPTIMIZATION
DOI
https://doi.org/10.1007/s10898-012-9854-y
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
Control and optimal response problems for quasilinear impulsive integrodifferential equations
Akhmet, Marat; Tleubergenova, MA; Weber, GW (Elsevier BV, 2006-03-16)
In various real-world applications, there is a necessity given to steer processes in time. More and more it becomes acknowledged in science and engineering, that these processes exhibit discontinuities.
Strategy creation, decomposition and distribution in particle navigation
Beldek, Ulas; Leblebicioğlu, Mehmet Kemal (Elsevier BV, 2007-02-01)
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-based hierarchical structures to move the particles in a grid region to accomplish navigation tasks. Communications operations such as receiving and sending commands between particles are also provided to develop improved strategies. In order to produce more capable strategies, a task decomposition procedure is proposed. In addition,...
Free gait generation with reinforcement learning for a six-legged robot
Erden, Mustafa Suphi; Leblebicioğlu, Mehmet Kemal (Elsevier BV, 2008-03-31)
In this paper the problem of free gait generation and adaptability with reinforcement learning are addressed for a six-legged robot. Using the developed free gait generation algorithm the robot maintains to generate stable gaits according to the commanded velocity. The reinforcement learning scheme incorporated into the free gait generation makes the robot choose more stable states and develop a continuous walking pattern with a larger average stability margin. While walking in normal conditions with no ext...
Educational affordances of a specific web-based assistive technology for students with visual impairment
ARSLANTAŞ, TUĞBA KAMALI; Yıldırım, İbrahim Soner; ARSLANTEKİN, BANU (Informa UK Limited, 2019-05-01)
The main aim of this study was to design, develop and test the instructional effectiveness of a web-based English vocabulary drill program developed for visually impaired middle school students. In this respect, the study focused on the educational affordances of the program and its contribution on VI students' spelling and semantics knowledge in English vocabulary. Depending on the purpose and the nature of the study, exploratory case study and single-subject research were implemented. Face-to-face interve...
On-demand conversation customization for services in large smart environments
Elgedawy, I. (IBM, 2011-01-01)
Services in large smart environments, as defined in this paper, are "aware" of their users' contexts and goals and are able to automatically interact with one another in order to achieve these goals. Unfortunately, interactions between services (i.e., service conversations) are not necessarily compatible, as services could have different interfaces (i.e., signature incompatibilities), as well as different logic for message ordering (i.e., protocol incompatibilities). Such conversation incompatibilities crea...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Z. Volkovich, D. Toledano-Kitai, and G. W. Weber, “Self-learning K-means clustering: a global optimization approach,”
JOURNAL OF GLOBAL OPTIMIZATION
, pp. 219–232, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56690.