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

DOI10.1016/S0167-8655(02)00198-8MaRDI QIDQ4421058zbMATH OpenOpenAlexFDO

Authors Pabitra Mitra, M.D. Aleemuddin Siddiqi, Sankar K. 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 miningPattern recognitionMinimal spanning treeMixture modellingRough knowledge encoding

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Information and Knowledge Systems
• Density based fuzzy \(c\)-means clustering of non-convex patterns
• scientific article; zbMATH DE number 2033144
• A robust EM clustering algorithm for Gaussian mixture models
• Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms

Cited in

(7)

• Rough Sets: From Rudiments to Challenges
• Rudiments of rough sets
• Some Foundational Aspects of Rough Sets Rendering Its Wide Applicability
• Rough sets and Boolean reasoning
• A clustering algorithm for supplier base management
• Graph and matrix approaches to rough sets through matroids
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421058)