نتایج جستجو برای: k means cluster

تعداد نتایج: 880962  

Journal: :ISPRS Int. J. Geo-Information 2017
Wei Chen Hongxing Han Bin Huang Qile Huang Xudong Fu

A landslide susceptibility map plays an essential role in urban and rural planning. The main purpose of this study is to establish a variable-weighted linear combination model (VWLC) and assess its potential for landslide susceptibility mapping. Firstly, different objective methods are employed for data processing rather than the frequently-used subjective judgments: K-means clustering is used ...

2015
L. Baringo A. J. Conejo

Stochastic programming constitutes a useful tool to address investment problems. This technique represents uncertain input data using a set of scenarios, which should accurately describe the involved uncertainty. In this paper, we propose two alternative methodologies to efficiently generate electric load and wind-power production scenarios, which are used as input data for investment problems....

Journal: :Expert Syst. Appl. 2010
Seyed Mohammad Seyed Hosseini Anahita Maleki Mohammad R. Gholamian

Data mining (DM) methodology has a tremendous contribution for researchers to extract the hidden knowledge and information which have been inherited in the data used by researchers. This study has proposed a new procedure, based on expanded RFM model by including one additional parameter, joining WRFM-based method to K-means algorithm applied in DM with K-optimum according to Davies– Bouldin In...

2015
Christian Bauckhage Rafet Sifa

We explore the idea of clustering according to extremal rather than to central data points. To this end, we introduce the notion of the maxoid of a data set and present an algorithm for k-maxoids clustering which can be understood as a variant of classical k-means clustering. Exemplary results demonstrate that extremal cluster prototypes are more distinctive and hence more interpretable than ce...

Journal: :CoRR 2017
Srikanta Kolay Kumar Sankar Ray Abhoy Chand Mondal

K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this probl...

2013
Ernesto Moreno Miguel A. Gómez Carlos Lago Jaime Sampaio

The aim of the present study was to identify the effects of a starting score-line on the game quarter final score (final quarter outcome except for the first period) when considering the quality of the opposition and game location. The sample comprised 1,456 game quarters from the Spanish women’s professional league (seasons 2009/2010 and 2010/2011). A k-means cluster analysis classified the ga...

Journal: :Computational Statistics & Data Analysis 2010
Marianna Lyra J. Paha Sandra Paterlini Peter Winker

Basel II imposes regulatory capital on banks related to the default risk of their credit portfolio. Banks using an internal rating approach compute the regulatory capital from pooled probabilities of default. These pooled probabilities can be calculated by clustering credit borrowers into different buckets and computing the mean PD for each bucket. The clustering problem can become very complex...

Journal: :Pattern Recognition Letters 2007
Stephen James Redmond Conor Heneghan

We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. We then use a modi cation of Katsavounidis' algorithm, which incorporates this density information, to choose K seeds for the K-means algorithm. We test our algorithm on 36 synthetic data sets and compare with 25 runs ...

2015
Mara Chinea-Rios Germán Sanchis-Trilles Francisco Casacuberta

In this paper, we present a clustering approach based on the combined use of a continuous vector space representation of sentences and the k-means algorithm. The principal motivation of this proposal is to split a big heterogeneous corpus into clusters of similar sentences. We use the word2vec toolkit for obtaining the representation of a given word as a continuous vector space. We provide empi...

2006
Indranil Bose Chen Xi

Customer clustering is used to understand customers’ preferences and behaviors by examining the differences and similarities between customers. Kohonen vector quantization clustering technology is used in this research and is compared with Kmeans clustering. The data set consists of customer records obtained from a mobile telecommunications service provider. The customers are clustered using va...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید