Sciweavers

1036 search results - page 30 / 208
» Algorithms for Learning Regular Expressions
Sort
View
109
Voted
UAI
2003
15 years 3 months ago
Learning Module Networks
Methods for learning Bayesian networks can discover dependency structure between observed variables. Although these methods are useful in many applications, they run into computat...
Eran Segal, Dana Pe'er, Aviv Regev, Daphne Koller,...
123
Voted
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 7 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
ALT
2003
Springer
15 years 10 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
SIGIR
2008
ACM
15 years 1 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
132
Voted
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 9 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani