Sciweavers

1107 search results - page 212 / 222
» Multi-instance tree learning
Sort
View
ICML
1998
IEEE
15 years 12 months ago
Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...
Moisés Goldszmidt, Nir Friedman, Thomas J. ...
WWW
2002
ACM
15 years 11 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
15 years 11 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
15 years 11 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...