Sciweavers

KDD
2004
ACM
154views Data Mining» more  KDD 2004»
14 years 5 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 5 months ago
Graphical models for data mining
David Heckerman
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 5 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 5 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 5 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 5 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 5 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
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 5 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2004
ACM
106views Data Mining» more  KDD 2004»
14 years 5 months ago
Early detection of insider trading in option markets
"Inside information" comes in many forms: knowledge of a corporate takeover, a terrorist attack, unexpectedly poor earnings, the FDA's acceptance of a new drug, etc...
Steve Donoho
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
14 years 5 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han