Sciweavers

238 search results - page 17 / 48
» Learning Recursive Automata from Positive Examples
Sort
View
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
14 years 8 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 11 months ago
Multi-label learning by exploiting label dependency
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
Min-Ling Zhang, Kun Zhang
24
Voted
JMLR
2011
111views more  JMLR 2011»
13 years 2 months ago
Models of Cooperative Teaching and Learning
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...
WWW
2008
ACM
14 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
FORMATS
2007
Springer
14 years 1 months ago
On Timed Models of Gene Networks
Abstract. We present a systematic translation from timed models of genetic regulatory networks into products of timed automata to which one can apply verification tools in order l...
Grégory Batt, Ramzi Ben Salah, Oded Maler