To see the other types of publications on this topic, follow the link: K-Means Technique.

Dissertations / Theses on the topic 'K-Means Technique'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 21 dissertations / theses for your research on the topic 'K-Means Technique.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Thirathon, Nattavude 1980. "Cyclic exchange neighborhood search technique for the K-means clustering problem." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17981.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (p. 151-152).<br>Cyclic Exchange is an application of the cyclic transfers neighborhood search technique for the k-means clustering problem. Neighbors of a feasible solution are obtained by moving points between clusters in a cycle. This method attempts to improve local minima obtained by the well-known Lloyd's algorithm. Although the results did not establish usefulness of Cyclic Exchange, our experiments reveal some insights on the k-mean
APA, Harvard, Vancouver, ISO, and other styles
2

Ranby, Erik. "A comparison of clustering techniques for short social text messages." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196735.

Full text
Abstract:
The amount of social text messages authored each day is huge and the information contained within is potentially very valuable. Software that can cluster and thereby help analyze these messages would consequently be helpful. This thesis explores several ways of clustering social text messages. Two algorithms and several setups with these algorithms have been tested and evaluated with the same data as input. Based on these evaluations, a comparison has been conducted in order to answer the question which algorithm setup is best suited for the task. The two clustering algorithms that have been t
APA, Harvard, Vancouver, ISO, and other styles
3

Kerwin, Matthew. "Comparison of Traditional Image Segmentation Techniques and Geostatistical Threshold." Thesis, James Cook University, 2006. https://eprints.qut.edu.au/99764/1/kerwin-honours-thesis.pdf.

Full text
Abstract:
A general introduction to image segmentation is provided, including a detailed description of common classic techniques: Otsu’s threshold, <i>k</i>-means and fuzzy <i>c</i>-means clustering; and suggestions of ways in which these techniques have been subsequently modified for special situations. Additionally, a relatively new approach is described, which attempts to address certain exposed failings of the classic techniques listed by incorporating a spatial statistical analysis technique commonly used in geological studies. Results of different segmentation techniques are calculated for
APA, Harvard, Vancouver, ISO, and other styles
4

Abreu, Rodolfo Telo Martins de. "Algorithms for information extraction and signal annotation on long-term biosignals using clustering techniques." Master's thesis, Faculdade de Ciências e Tecnologia, 2012. http://hdl.handle.net/10362/8250.

Full text
Abstract:
Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica<br>One of the biggest challenges when analysing data is to extract information from it, especially if we dealing with very large sized data, which brings a new set of barriers to be overcome. The extracted information can be used to aid physicians in their diagnosis since biosignals often carry vital information on the subjects. In this research work, we present a signal-independent algorithm with two main goals: perform events detection in biosignals and, with those events, extract information using a set of distance meas
APA, Harvard, Vancouver, ISO, and other styles
5

Frederic, John. "Examination of Initialization Techniques for Nonnegative Matrix Factorization." Digital Archive @ GSU, 2008. http://digitalarchive.gsu.edu/math_theses/63.

Full text
Abstract:
While much research has been done regarding different Nonnegative Matrix Factorization (NMF) algorithms, less time has been spent looking at initialization techniques. In this thesis, four different initializations are considered. After a brief discussion of NMF, the four initializations are described and each one is independently examined, followed by a comparison of the techniques. Next, each initialization's performance is investigated with respect to the changes in the size of the data set. Finally, a method by which smaller data sets may be used to determine how to treat larger data sets
APA, Harvard, Vancouver, ISO, and other styles
6

Aksoy, Ece. "An Attempt To Classify Turkish District Data: K-means And Self-organizing Map (som) Algorithms." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12605711/index.pdf.

Full text
Abstract:
ABSTRACT AN ATTEMPT TO CLASSIFY TURKISH DISTRICT DATA: K-MEANS AND SELF-ORGANIZING MAP (SOM) ALGORITHMS Aksoy, Ece M.S., Department of Geodetic and Geographic Information Systems Supervisor: Assoc. Prof. Dr. Oguz ISik December 2004, 112 pages There is no universally applicable clustering technique in discovering the variety of structures display in data sets. Also, a single algorithm or approach is not adequate to solve every clustering problem. There are many methods available, the criteria used differ and hence different classifications may be obtained for the same data. While large
APA, Harvard, Vancouver, ISO, and other styles
7

Arnroth, Lukas, and Dennis Jonni Fiddler. "Supervised Learning Techniques : A comparison of the Random Forest and the Support Vector Machine." Thesis, Uppsala universitet, Statistiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-274768.

Full text
Abstract:
This thesis examines the performance of the support vector machine and the random forest models in the context of binary classification. The two techniques are compared and the outstanding one is used to construct a final parsimonious model. The data set consists of 33 observations and 89 biomarkers as features with no known dependent variable. The dependent variable is generated through k-means clustering, with a predefined final solution of two clusters. The training of the algorithms is performed using five-fold cross-validation repeated twenty times. The outcome of the training process rev
APA, Harvard, Vancouver, ISO, and other styles
8

Örnbratt, Filip, Jonathan Isaksson, and Mario Willing. "A comparative study of social bot classification techniques." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16994.

Full text
Abstract:
With social media rising in popularity over the recent years, new so called social bots are infiltrating by spamming and manipulating people all over the world. Many different methods have been presented to solve this problem with varying success. This study aims to compare some of these methods, on a dataset of Twitter account metadata, to provide helpful information to companies when deciding how to solve this problem. Two machine learning algorithms and a human survey will be compared on the ability to classify accounts. The algorithms used are the supervised algorithm random forest and the
APA, Harvard, Vancouver, ISO, and other styles
9

Mansouri, Abdelkhalek. "Generic heuristics on GPU to superpixel segmentation and application to optical flow estimation." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA012.

Full text
Abstract:
Déterminer des clusters dans des nuages de points et apparier des graphes sont des tâches primordiales en informatique, analyse de donnée, traitement d’image, généralement modélisées par des problèmes d’optimisation de classe NP-difficile. Avec l’avènement des multiprocesseurs à bas coût, l’accélération des procédures heuristiques pour ces tâches devient possible et nécessaire. Nous proposons des implantations parallèles sur système GPU (graphics processing unit) pour des algorithmes génériques appliqués ici à la segmentation d’image en superpixels et au problème du flot optique. Le but est de
APA, Harvard, Vancouver, ISO, and other styles
10

Storer, Jeremy J. "Computational Intelligence and Data Mining Techniques Using the Fire Data Set." Bowling Green State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1460129796.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

El, Asmar Saadallah. "Contributions à la segmentation non supervisée d'images hyperspectrales : trois approches algébriques et géométriques." Thesis, La Rochelle, 2016. http://www.theses.fr/2016LAROS023/document.

Full text
Abstract:
Depuis environ une dizaine d’années, les images hyperspectrales produites par les systèmes de télédétection, “Remote Sensing”, ont permis d’obtenir des informations très fiables quant aux caractéristiques spectrales de matériaux présents dans une scène donnée. Nous nous intéressons dans ce travail au problème de la segmentation non supervisée d’images hyperspectrales suivant trois approches bien distinctes. La première, de type Graph Embedding, nécessite deux étapes : une première étape d’appariement des pixels de patchs de l’image initiale grâce à une mesure de similarité spectrale entre pixe
APA, Harvard, Vancouver, ISO, and other styles
12

Pechstein, Armin [Verfasser], Sabine [Gutachter] Attinger, and Nadim K. [Gutachter] Copty. "Innovative techniques for the characterization and interpretation of coastal aquifers : pumping test interpretation by means of the drawdown derivative to estimate aquifer heterogeneity / Armin Pechstein ; Gutachter: Sabine Attinger, Nadim K. Copty." Jena : Friedrich-Schiller-Universität Jena, 2017. http://d-nb.info/1177603160/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Ben, Arab Taher. "Contribution des familles exponentielles en traitement des images." Phd thesis, Université du Littoral Côte d'Opale, 2014. http://tel.archives-ouvertes.fr/tel-01019983.

Full text
Abstract:
Cette thèse est consacrée à l'évaluation des familles exponentielles pour les problèmes de la modélisation des bruits et de la segmentation des images couleurs. Dans un premier temps, nous avons développé une nouvelle caractérisation des familles exponentielles naturelles infiniment divisible basée sur la fonction trace de la matrice de variance covariance associée. Au niveau application, cette nouvelle caractérisation a permis de détecter la nature de la loi d'un bruit additif associé à un signal où à une image couleur. Dans un deuxième temps, nous avons proposé un nouveau modèle statistique
APA, Harvard, Vancouver, ISO, and other styles
14

Ren, Yi. "Indexation et recherche de similarités avec des descripteurs structurés par coupes d'images sur des graphes." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0215/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la recherche d’images similaires avec des descripteurs structurés par découpages d’images sur les graphes.Nous proposons une nouvelle approche appelée “bag-of-bags of words” (BBoW) pour la recherche d’images par le contenu (CBIR). Il s’agit d’une extension du modèle classique dit sac-de-mots (bag of words - BoW). Dans notre approche, une image est représentée par un graphe placé sur une grille régulière de pixels d’image. Les poids sur les arêtes dépendent de caractéristiques locales de couleur et texture. Le graphe est découpé en un nombre fixe de rég
APA, Harvard, Vancouver, ISO, and other styles
15

Kan, Fengjung, and 甘豐榮. "Genetic Algorithm-based K-means Clustering Technique And Its Application To Cardiac Disease Diagnosis." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/39793384358869647744.

Full text
Abstract:
碩士<br>義守大學<br>資訊管理學系<br>100<br>With the rapid advancement of science and technology, diseases resulting from the development of civilization have increased in our daily life. Heart diseases are among them and have become more and more widespread in recent years due to the change in people's diet and lifetime habits such as smoking, drug abuse, and the increase in the consumption of animal products, fat, and sugar. In addition, great pressure coming with the urbanization may cause people to easily have high blood pressure. The obvious lack of exercise increases the chance of obesity. All of th
APA, Harvard, Vancouver, ISO, and other styles
16

Hung, Cheng-Shing, and 洪晟翔. "Multiple objects tracking technique based on orthogonal variant moments features and K-means clustering." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/52121726442420030955.

Full text
Abstract:
碩士<br>國立屏東教育大學<br>資訊科學系碩士班<br>101<br>Traditional Moment although could be tracking objects, not only could not directly tracking multiple objects, but also it’s susceptible to noise interference. In this study, we use Orthogonal Variant Moments features to solve this problem. The first step we use the Background Subtraction method to find the some edges of motion objects, and then we use the Morphology method to solve some edges are disconnected of objects. The second step, compute the OVM features in the tth frame in while OVM features can be use to five the different image features of proper
APA, Harvard, Vancouver, ISO, and other styles
17

"Transportation Techniques for Geometric Clustering." Doctoral diss., 2020. http://hdl.handle.net/2286/R.I.57239.

Full text
Abstract:
abstract: This thesis introduces new techniques for clustering distributional data according to their geometric similarities. This work builds upon the optimal transportation (OT) problem that seeks global minimum cost for matching distributional data and leverages the connection between OT and power diagrams to solve different clustering problems. The OT formulation is based on the variational principle to differentiate hard cluster assignments, which was missing in the literature. This thesis shows multiple techniques to regularize and generalize OT to cope with various tasks including clust
APA, Harvard, Vancouver, ISO, and other styles
18

Cernaut, Oana-Maria. "Customer targeting models using data mining techniques." Master's thesis, 2019. http://hdl.handle.net/10773/30010.

Full text
Abstract:
In recent years, the segmentation process has undergone numerous changes, once with the advances in data mining. Knowledge discovery can automatize and provide better insights into customer trends and dynamics. The objective of the paper is to improve the quality of the marketing segmentation for company T. More specifically, the research question it plans to answer is whether data mining techniques deliver a better segmentation model than intuitive approaches. The segmentation steps comprise the identification of the necessary variables, the selection of the relevant ones to conduct the segme
APA, Harvard, Vancouver, ISO, and other styles
19

(6565679), Fang-Yu Rao. "Privacy-Enhancing Techniques for Data Analytics." Thesis, 2019.

Find full text
Abstract:
<div> <div> <div> <p>Organizations today collect and aggregate huge amounts of data from individuals under various scenarios and for different purposes. Such aggregation of individuals’ data when combined with techniques of data analytics allows organizations to make informed decisions and predictions. But in many situations, different portions of the data associated with individuals are collected and curated by different organizations. To derive more accurate conclusions and predictions, those organization may want to conduct the analysis based on their joint data, which cannot be simply acco
APA, Harvard, Vancouver, ISO, and other styles
20

Yang, Huanyi. "Performance analysis of EM-MPM and K-means clustering in 3D ultrasound breast image segmentation." 2014. http://hdl.handle.net/1805/3875.

Full text
Abstract:
Indiana University-Purdue University Indianapolis (IUPUI)<br>Mammographic density is an important risk factor for breast cancer, detecting and screening at an early stage could help save lives. To analyze breast density distribution, a good segmentation algorithm is needed. In this thesis, we compared two popularly used segmentation algorithms, EM-MPM and K-means Clustering. We applied them on twenty cases of synthetic phantom ultrasound tomography (UST), and nine cases of clinical mammogram and UST images. From the synthetic phantom segmentation comparison we found that EM-MPM performs better
APA, Harvard, Vancouver, ISO, and other styles
21

Jian, Wen-Shan, and 簡文珊. "Fuzzy Forecasting Based on Fuzzy Logical Relationships, Fuzzy-Trend Logical Relationship Groups, K-Means Clustering Algorithm, Similarity Measures and Particle Swarm Optimization Techniques." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/54195019537890008557.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>資訊工程系<br>103<br>In this thesis, we propose two new fuzzy forecasting methods to deal with forecasting problems based on fuzzy logical relationships, fuzzy-trend logical relationship groups, K-means clustering algorithm, similarity measures and particle swarm optimization (PSO) techniques. In the first method of this thesis, we propose a new method for forecasting the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) based on fuzzy time series, fuzzy logical relationships, particle swarm optimization (PSO) techniques, the K-means clustering algorithm, and simil
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!