Sciweavers

1225 search results - page 108 / 245
» The Instance Complexity Conjecture
Sort
View
AAAI
2007
13 years 11 months ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 10 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
LREC
2008
155views Education» more  LREC 2008»
13 years 10 months ago
L-ISA: Learning Domain Specific Isa-Relations from the Web
Automated extraction of ontological knowledge from text corpora is a relevant task in Natural Language Processing. In this paper, we focus on the problem of finding hypernyms for ...
Alessandra Potrich, Emanuele Pianta
RECSYS
2010
ACM
13 years 9 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
FGCS
2006
113views more  FGCS 2006»
13 years 9 months ago
Performance feature identification by comparative trace analysis
This work introduces a method for instrumenting applications, producing execution traces, and visualizing multiple trace instances to identify performance features. The approach p...
Daniel P. Spooner, Darren J. Kerbyson