Sciweavers

915 search results - page 63 / 183
» Maximally Abstract Retrenchments
Sort
View
MCS
2004
Springer
14 years 1 months ago
A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Hanan Ayad, Otman A. Basir, Mohamed Kamel
SETN
2004
Springer
14 years 1 months ago
Incremental Mixture Learning for Clustering Discrete Data
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
Konstantinos Blekas, Aristidis Likas
ICANN
2003
Springer
14 years 1 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
IPSN
2003
Springer
14 years 1 months ago
A Collaborative Approach to In-Place Sensor Calibration
Abstract. Numerous factors contribute to errors in sensor measurements. In order to be useful, any sensor device must be calibrated to adjust its accuracy against the expected meas...
Vladimir Bychkovskiy, Seapahn Megerian, Deborah Es...
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich