Sciweavers

506 search results - page 72 / 102
» Learning Bayesian Networks from Incomplete Databases
Sort
View
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
ESWA
2008
169views more  ESWA 2008»
14 years 9 months ago
Predicting opponent's moves in electronic negotiations using neural networks
Electronic negotiation experiments provide a rich source of information about relationships between the negotiators, their individual actions, and the negotiation dynami...
Réal Carbonneau, Gregory E. Kersten, Rustam...
BMVC
1997
14 years 11 months ago
Employing Region Features for Searching an Image Database
This paper describes recent work on the use of regional data extracted from segmented images for use as search keys in an image database query system. The motivation for this work...
Matthew E. J. Wood, Neill W. Campbell, Barry T. Th...
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
15 years 2 months ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...