Speed-up for the expectation-maximization algorithm for clustering categorical data

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.37, Iss.4, 2007-04, pp. : 513-525

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Novel Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

International Journal of Ambient Computing and Intelligence (IJACI), Vol. 7, Iss. 2, 2016-07 ,pp. : 47-74

IGI Global_journal

Access to resources Recommend Favorite

A Support Based Initialization Algorithm for Categorical Data Clustering

Journal of Information Technology Research (JITR), Vol. 11, Iss. 2, 2018-04 ,pp. : 53-67

IGI Global_journal

Access to resources Recommend Favorite

Human Tracking System Integrating Sound and Face Localization Using an Expectation-Maximization Algorithm in Real Environments

By Kim Hyun-Don Komatani Kazunori Ogata Tetsuya Okuno Hiroshi G.

Advanced Robotics, Vol. 23, Iss. 6, 2009-04 ,pp. : 629-653

Taylor & Francis Ltd

Access to resources Recommend Favorite

Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values

By Huang Zhexue

Data Mining and Knowledge Discovery, Vol. 2, Iss. 3, 1998-09 ,pp. : 283-304

Springer Publishing Company

Access to resources Recommend Favorite

On clustering massive text and categorical data streams

By Aggarwal Charu Yu Philip

Knowledge and Information Systems, Vol. 24, Iss. 2, 2010-08 ,pp. : 171-196

Springer Publishing Company

Access to resources Recommend Favorite