Normalization based K means Clustering Algorithm

2015-03-03 · Deepali Virmani, Shweta Taneja, Geetika Malhotra

K-means is an effective clustering technique used to separate similar data into groups based on initial centroids of clusters. In this paper, Normalization based K-means clustering algorithm(N-K means) is proposed. Proposed N-K means clustering algorithm applies normalization prior to clustering on the available data as well as the proposed approach calculates initial centroids based on weights. Experimental results prove the betterment of proposed N-K means clustering algorithm over existing K-means clustering algorithm in terms of complexity and overall performance.

📄 PDF Abstract BibTeX arXiv:1503.00900

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Methods 이 논문이 사용한 방법론

k-Means Clustering k-Means Clustering is a clustering algorithm that divides a training set into $k$ different clusters of examples that are near each other. It works by initializing $k$…

Evaluation of k-means time series clustering based on z-normalization and NP-Free

2024-01-28 · Ming-Chang Lee, Jia-Chun Lin, Volker Stolz

Despite the widespread use of k-means time series clustering in various domains, there exists a gap in the literature regarding its comprehensive evaluation with different time series normalization approaches. This paper…

Clustering Time Series Time Series Clustering

Clustering and Unsupervised Anomaly Detection with L2 Normalized Deep Auto-Encoder Representations

2018-02-01 · Caglar Aytekin, Xingyang Ni, Francesco Cricri, Emre Aksu

Clustering is essential to many tasks in pattern recognition and computer vision. With the advent of deep learning, there is an increasing interest in learning deep unsupervised representations for clustering analysis. M…

Anomaly Detection Clustering Unsupervised Anomaly Detection

Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective

2025-09-23 · Wenlong Lyu, Yuheng Jia, Hui Liu, Junhui Hou arxiv

The well-known graph-based clustering methods, including spectral clustering, symmetric non-negative matrix factorization, and doubly stochastic normalization, can be viewed as relaxations of the kernel $k$-means approac…

Hybrid data clustering approach using K-Means and Flower Pollination Algorithm

2015-05-13 · R. Jensi, G. Wiselin Jiji

Data clustering is a technique for clustering set of objects into known number of groups. Several approaches are widely applied to data clustering so that objects within the clusters are similar and objects in different …

Clustering global-optimization

initKmix -- A Novel Initial Partition Generation Algorithm for Clustering Mixed Data using k-means-based Clustering

2019-01-31 · Amir Ahmad, Shehroz S. Khan

Mixed datasets consist of both numeric and categorical attributes. Various k-means-based clustering algorithms have been developed for these datasets. Generally, these algorithms use random partition as a starting point,…