A Multinomial prototype-based learning algorithm

Download

index.pdf

Date

2014

Author

Bulut, Ahmet Can

Metadata

Show full item record

Item Usage Stats

217
views

109
downloads

Recent studies in machine learning field proved that ideas which were once thought impractical are in fact tangible. Over the years, researchers have managed to develop learning systems which are able to interact with the environment and use experiences for adaptation to new conditions. Humanoid robots can now learn concepts such as nouns, adjectives and verbs, which is a big step for building human-like learners. Behind all these achievements, development of successful learning and classification techniques is one of the key factors. In this thesis, we propose a novel prototype-based learning method which uses the distributional properties of class dimensions. By dealing with the problem of feature dimensions' having multiple polarities, our algorithm can distinguish the dimensions which display unpredictable behaviors from the ones which are composed of multiple predictable patterns. We tested our algorithm on 8 different datasets and compared the results with 9 other algorithms including SVM and AdaBoost. Apart from being insensitive to the ordering of inputs, our method showed that it provides comparable performance in terms of accuracy rate, running time, learning curve and most importantly the ability to resolve multipolarity in dimensions.

Subject Keywords

Robotics., Androids., Machine learning., Cognitive science., Concept learning., Artificial intelligence.

URI

http://etd.lib.metu.edu.tr/upload/12618176/index.pdf
https://hdl.handle.net/11511/24178

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A Heuristic temporal difference approach with adaptive grid discretization Fikir, Ozan Bora; Polat, Faruk; Department of Computer Engineering (2016) Reinforcement learning (RL), as an area of machine learning, tackle with the problem defined in an environment where an autonomous agent ought to take actions to achieve an ultimate goal. In RL problems, the environment is typically formulated as a Markov decision process. However, in real life problems, the environment is not flawless to be formulated as an MDP, and we need to relax fully observability assumption of MDP. The resulting model is partially observable Markov decision process, which is a more r...
A new contribution to nonlinear robust regression and classification with mars and its applications to data mining for quality control in manufacturing Yerlikaya, Fatma; Weber, Gerhard Wilhelm; Department of Scientific Computing (2008) Multivariate adaptive regression spline (MARS) denotes a modern methodology from statistical learning which is very important in both classification and regression, with an increasing number of applications in many areas of science, economy and technology. MARS is very useful for high dimensional problems and shows a great promise for fitting nonlinear multivariate functions. MARS technique does not impose any particular class of relationship between the predictor variables and outcome variable of interest....
Effective subgoal discovery and option generation in reinforcement learning Demir, Alper; Polat, Faruk; Department of Computer Engineering (2016) Subgoal discovery is proven to be a practical way to cope with large state spaces in Reinforcement Learning. Subgoals are natural hints to partition the problem into sub-problems, allowing the agent to solve each sub-problem separately. Identification of such subgoal states in the early phases of the learning process increases the learning speed of the agent. In a problem modeled as a Markov Decision Process, subgoal states possess key features that distinguish them from the ordinary ones. A learning agent ...
A Deep Dive into Adversarial Robustness in Zero-Shot Learning Yücel, Mehmet Kerim; Cinbiş, Ramazan Gökberk; Duygulu Şahin, Pınar (Springer; 2020-08-23) Machine learning (ML) systems have introduced significant advances in various fields, due to the introduction of highly complex models. Despite their success, it has been shown multiple times that machine learning models are prone to imperceptible perturbations that can severely degrade their accuracy. So far, existing studies have primarily focused on models where supervision across all classes were available. In constrast, Zero-shot Learning (ZSL) and Generalized Zero-shot Learning (GZSL) tasks inherently...
A Graph-Based Concept Discovery Method for n-Ary Relations Abay, Nazmiye Ceren; MUTLU, ALEV; Karagöz, Pınar (2015-09-04) Concept discovery is a multi-relational data mining task for inducing definitions of a specific relation in terms of other relations in the data set. Such learning tasks usually have to deal with large search spaces and hence have efficiency and scalability issues. In this paper, we present a hybrid approach that combines association rule mining methods and graph-based approaches to cope with these issues. The proposed method inputs the data in relational format, converts it into a graph representation, and...

Citation Formats

A. C. Bulut, “A Multinomial prototype-based learning algorithm,” M.S. - Master of Science, Middle East Technical University, 2014.