Non-convex clustering using expectation maximization algorithm with rough set initialization

DOI10.1016/S0167-8655(02)00198-8zbMath1053.68098OpenAlexW2123123669MaRDI QIDQ4421058

M.D. Aleemuddin Siddiqi, Pabitra Mitra, Sankar Kumar Pal

Publication date: 19 August 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00198-8

zbMATH Keywords

Data miningMinimal spanning treePattern recognitionMixture modellingRough knowledge encoding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Knowledge representation (68T30)

Related Items (7)

A clustering algorithm for supplier base management ⋮ Rudiments of rough sets ⋮ Rough sets and Boolean reasoning ⋮ Some Foundational Aspects of Rough Sets Rendering Its Wide Applicability ⋮ Graph and matrix approaches to rough sets through matroids ⋮ Rough Sets: From Rudiments to Challenges ⋮ Identification of piecewise affine systems based on statistical clustering technique

This page was built for publication: Non-convex clustering using expectation maximization algorithm with rough set initialization