Sciweavers

446 search results - page 62 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 11 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 10 months ago
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 contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
BMCBI
2010
149views more  BMCBI 2010»
13 years 10 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...