Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
A time-efficient pattern reduction algorithm for k-means clustering
Home
Publications
A time-efficient pattern reduction algorithm for k-means clustering
A time-efficient pattern reduction algorithm for k-means clustering
Authors:
MC
Ming-Chao Chiang
Ming-Chao Chiang
CT
Chun-Wei Tsai
Chun-Wei Tsai
CY
Chu-Sing Yang
Chu-Sing Yang
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
15 February 2011
journal article
Published by
Elsevier
in
Information Sciences
Vol. 181
(4)
,
716-731
DOI:
10.1016/j.ins.2010.10.008
Abstract
No abstract available
Keywords
PROPOSED ALGORITHM WORK
ITERATIVE CLUSTERING ALGORITHM
K-MEANS CLUSTERING
K-MEANS-BASED CLUSTERING ALGORITHM
STATE-OF-THE-ART CLUSTERING
PROPOSED ALGORITHM SIMPLE
COMPUTATION TIME
POPULATION-BASED CLUSTERING ALGORITHM
PROPOSED ALGORITHM
EFFICIENT ALGORITHM
TIME-EFFICIENT PATTERN REDUCTION ALGORITHM
HIGH-DIMENSIONAL DATA SET
K MEANS CLUSTERING
HIGH DIMENSIONAL DATA
K MEANS
DATA CLUSTERING
Cited
Cited by 88 articles
Scroll to top