140 search results - page 6 / 28 » kdd 2004 |
KDD
2004
ACM
14 years 10 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. Current text classification systems typically use term stems for representing document content. Semantic Web technologies allow the usage of features on a higher semantic...
KDD
2004
ACM
14 years 3 months ago
2004
ACM
We present a algorithm based on factor analysis for performing collaborative quality filtering (CQF). Unlike previous approaches to CQF, which estimate the consensus opinion of a...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...