Sciweavers

8 search results - page 1 / 2
» Binary Rule Generation via Hamming Clustering
Sort
View
TKDE
2002
133views more  TKDE 2002»
13 years 4 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
JUCS
2010
176views more  JUCS 2010»
13 years 3 months ago
An Approach to Generation of Decision Rules
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
Zhang Mingyi, Danning Li, Zhang Ying
SADM
2010
141views more  SADM 2010»
12 years 11 months ago
A parametric mixture model for clustering multivariate binary data
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
Ajit C. Tamhane, Dingxi Qiu, Bruce E. Ankenman
EUROCRYPT
1999
Springer
13 years 8 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
SAC
2010
ACM
13 years 11 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil