Cluster hypothesis

Known as: Cluster assumption 
In machine learning and information retrieval, the cluster hypothesis is an assumption about the nature of the data handled in those fields, which… (More)
Wikipedia

Related topics

Related topics

7 relations
Cluster analysisInformation retrievalK-means clusteringMachine learning
(More)

Broader (1)

Data modeling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A novel classification technique based on progressive transductive SVM learning
The existing semisupervised techniques based on progressive transductive support vector machine (PTSVM) iteratively select… (More)
Is this relevant?
2013
2013
The cluster hypothesis for entity oriented search
In this work we study the cluster hypothesis for entity oriented search (EOS). Specifically, we show that the hypothesis can hold… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Review
2013
Review
2013
The cluster hypothesis in information retrieval
The cluster hypothesis states that “closely associated documents tend to be relevant to the same requests” [1]. This is one of… (More)
Is this relevant?
2011
2011
The optimum clustering framework: implementing the cluster hypothesis
Document clustering offers the potential of supporting users in interactive retrieval, especially when users have problems in… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2009
2009
A New Measure of the Cluster Hypothesis
We have found that the nearest neighbor (NN) test is an insufficient measure of the cluster hypothesis. The NN test is a local… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
Testing the cluster hypothesis in distributed information retrieval
How to merge and organise query results retrieved from different resources is one of the key issues in distributed information… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Cluster Kernels for Semi-Supervised Learning
We propose a framework to incorporate unlabeled data in kernel classifier, based on the idea that two points in the same cluster… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results
We present Scatter/Gather, a cluster-based document browsing method, as an alternative to ranked titles for the organization and… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 4
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A self-organizing network for hyperellipsoidal clustering (HEC)
We propose a self-organizing network for hyperellipsoidal clustering (HEC). It consists of two layers. The first employs a number… (More)
Is this relevant?