Sciweavers

4708 search results - page 869 / 942
» Generating the Structure of Argument
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 10 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
KDD
2002
ACM
286views Data Mining» more  KDD 2002»
14 years 10 months ago
Object Boundary Detection For Ontology-Based Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
Lei Wang, Latifur Khan, Casey Breen
RECOMB
2002
Springer
14 years 10 months ago
Probabilistic hierarchical clustering for biological data
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
Eran Segal, Daphne Koller
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 10 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 10 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...