Keywords
Information bottleneck methodCluster analysisBottleneckComputer scienceData miningExtension (predicate logic)Relevance (law)Class (philosophy)Mutual informationMachine learningArtificial intelligenceTheoretical computer science
Affiliated Institutions
Related Publications
Input feature selection by mutual information based on Parzen window
Mutual information is a good indicator of relevance between variables, and have been used as a measure in several feature selection algorithms: However, calculating the mutual i...
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in continge...
McRank: Learning to Rank Using Multiple Classification and Gradient Boosting
We cast the ranking problem as (1) multiple classification (“Mc”) (2) multiple ordinal classification, which lead to computationally tractable learning algorithms for relevance ...
A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
In this paper the convergence of a class of clustering procedures, popularly known as the fuzzy ISODATA algorithms, is established. The theory of Zangwill is used to prove that ...
<b>ada</b>: An<i>R</i>Package for Stochastic Boosting
Boosting is an iterative algorithm that combines simple classification rules with "mediocre" performance in terms of misclassification error rate to produce a highly accurate cl...
Publication Info
- Year
- 2006
- Type
- article
- Volume
- 12
- Issue
- 1
- Pages
- 1-24
- Citations
- 58
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
58
OpenAlex
Cite This
David Gondek,
Thomas Hofmann
(2006).
Non-redundant data clustering.
Knowledge and Information Systems
, 12
(1)
, 1-24.
https://doi.org/10.1007/s10115-006-0009-7
Identifiers
- DOI
- 10.1007/s10115-006-0009-7