We present a new similarity measure between a single shape and a shape group as a basis for shape clustering following the paradigm of context dependent shape comparison: clusters are generated in the context of a reference shape, defined by the query shape it is compared to. Tightly coupled, the distance measure is the basis for a soft k-means like framework to achieve robust clustering. Succe...

Nowadays melanoma is one of the most important cancers to study due to its social impact. This dermatologic cancer has increased its frequency and mortality during last years. In particular, mortality is around twenty percent in non early detected ones. For this reason, the aim of medical researchers is to improve the early diagnosis through a best melanoma characterization using pattern matchi...

Internet crimes are now increasing. In a row with many crimes using information technology, in particular those using Internet, some crimes are often carried out in the form of attacks that occur within a particular agency or institution. To be able to find and identify the types of attacks, requires a long process that requires time, human resources and utilization of information technology to...

In this paper we describe two unsupervised representations of prosodic sequences based on k-means and Dirichlet Process Gaussian Mixture Model (DPGMM) clustering. The clustering algorithms are used to infer an inventory of prosodic categories over automatically segmented syllables. A tri-gram model is trained over these sequences to characterize speech. We find that DPGMM clusters show a greate...

Silhouette is one of the most popular and effective internal measures for the evaluation of clustering validity. Simplified Silhouette is a computationally simplified version of Silhouette. However, to date Simplified Silhouette has not been systematically analysed in a specific clustering algorithm. This paper analyses the application of Simplified Silhouette to the evaluation of k-means clust...

Clustering is a data mining activity that aims to differentiate groups inside a given set of objects, with respect to a set of relevant attributes of the analyzed objects. Generally, existing clustering methods, such as k-means algorithm, start with a known set of objects, measured against a known set of attributes. But there are numerous applications where the attribute set characterizing the ...

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 ...

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....

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...

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...