Sciweavers

1283 search results - page 73 / 257
» Probabilistic structured query methods
Sort
View
PKDD
2010
Springer
160views Data Mining» more  PKDD 2010»
13 years 7 months ago
Entropy and Margin Maximization for Structured Output Learning
Abstract. We consider the problem of training discriminative structured output predictors, such as conditional random fields (CRFs) and structured support vector machines (SSVMs)....
Patrick Pletscher, Cheng Soon Ong, Joachim M. Buhm...
AAAI
2008
13 years 11 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
ISNN
2005
Springer
14 years 2 months ago
Post-nonlinear Blind Source Separation Using Neural Networks with Sandwiched Structure
Abstract. This paper proposes a novel algorithm based on informax for postnonlinear blind source separation. The demixing system culminates to a neural network with sandwiched stru...
Chunhou Zheng, Deshuang Huang, Zhan-Li Sun, Li Sha...
DLOG
2010
13 years 6 months ago
Structure Preserving TBox Repair using Defaults
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
Thomas Scharrenbach, Rolf Grütter, Bettina Wa...
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 10 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank