Research article · Oct 2014
Conference abstractPublished 2017
Scalable robust clustering method for large and sparse data
University of Jyväskylä, Finland
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Clustering is the most common unsupervised, descriptive analysis technique to reveal hidden patterns and profiles from a dataset. There exists large number of different clustering algorithms, but approaches that specifically address clustering of sparse datasets are still scarce, even if real world datasets are many times characterized by missing values with unknown sparsity pattern. Typical approaches in the knowledge discovery process is to either completely omit the observations with missing values or use some imputation method to fill in the holes of data. However, the throw data away approach does not utilize all possible data and the imputation necessarily introduces assumptions about the unknown density of the data. Moreover, by the well-known curseof-dimensionality results, such assumptions are no more valid in the high dimensional spaces. The purpose of this presentation is to describe and summarize a line of research that addresses the sparse clustering problems with the available data strategy and robust prototypes. The strategy allows one to utilize all available data without any additional assumptions. The actual prototype-based clustering algorithm, the k-spatial medians, relies on the computation of a robust prototype as cluster centroid, again argumenting on non-Gaussian within-cluster error in comparison to the classical k-means method. As with any prototype-based algorithm, the initialization step of the locally improving relocation algorithm has an important role and should be designed to handle the sparse data. Such an approach is proposed and the scalability of a distributed implementation of the whole algorithm is tested with openly available large and sparse datasets.
Subjects
Computer Science & ITEngineeringAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Mar 2015
Scalable Learning for Collective Behaviour Using Sparse Social Dimensions
Research article · Oct 2013
An Efficient Numerical Methods for the Prediction of Clusters using K-means Algorithm with Bisection method for Comparing Uniform and Random Distribution Data Points
Research article · Feb 2015
Dynamic Personalized Recommendation Algorithm on Sparse Data
Research article · Mar 2014
Transferring Knowledge Using Feature Extraction from Sparse Data for Drug Toxicity Prediction Using Utility and Drug Combinations
More from this journal
The newest in Journal of Computer Engineering & Information Technology.
Review article · 27 Oct 2025
Dukan Daari Inventory Management System
Research article · 17 Jun 2025
Leveraging Information Flow Tracking for Enhanced Security in Cloud Computing
Editorial · 31 Mar 2025
Low-Code/No-Code Platforms: Democratizing Software Development
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Computer Engineering & Information Technology
- SubjectComputer Science & IT
- SubjectEngineering
- BylineArticles whose byline prints “Tommi Karkkainen”

