Sciweavers

2370 search results - page 219 / 474
» A Structured Set of Higher-Order Problems
Sort
View
127
Voted
CLA
2006
15 years 5 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
127
Voted
DBA
2006
182views Database» more  DBA 2006»
15 years 5 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
118
Voted
ACL
1998
15 years 5 months ago
Automatic Construction of Frame Representations for Spontaneous Speech in Unrestricted Domains
This paper presents a system which automatically generates shallow semantic frame structures for conversational speech in unrestricted domains. We argue that such shallow semantic...
Klaus Zechner
IJON
2008
114views more  IJON 2008»
15 years 4 months ago
A robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
Fabian J. Theis, Peter Gruber, Ingo R. Keck, Elmar...
JMLR
2006
116views more  JMLR 2006»
15 years 3 months ago
Step Size Adaptation in Reproducing Kernel Hilbert Space
This paper presents an online support vector machine (SVM) that uses the stochastic meta-descent (SMD) algorithm to adapt its step size automatically. We formulate the online lear...
S. V. N. Vishwanathan, Nicol N. Schraudolph, Alex ...