Sciweavers

KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 9 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 9 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2004
ACM
154views Data Mining» more  KDD 2004»
14 years 9 months ago
Diagnosing extrapolation: tree-based density estimation
There has historically been very little concern with extrapolation in Machine Learning, yet extrapolation can be critical to diagnose. Predictor functions are almost always learne...
Giles Hooker
KDD
2004
ACM
125views Data Mining» more  KDD 2004»
14 years 9 months ago
Graphical models for data mining
David Heckerman
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering complex matchings across web query interfaces: a correlation mining approach
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 months ago
Fast discovery of connection subgraphs
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...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 9 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 9 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 9 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu