7150 search results - page 889 / 1430 » Graph-Based Data Mining |
135
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
163
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
195
Voted
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
154
click to vote
KDD
2004
ACM
16 years 6 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...
153
click to vote
KDD
2004
ACM
16 years 6 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...