Sciweavers

7259 search results - page 18 / 1452
» From Fields to Trees
Sort
View
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
15 years 12 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
IJCAI
2003
15 years 26 days ago
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Information extraction (IE) aims at extracting specific information from a collection of documents. A lot of previous work on 10 from semi-structured documents (in XML or HTML) us...
Raymond Kosala, Maurice Bruynooghe, Jan Van den Bu...
ACL
1996
15 years 25 days ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
BIRTHDAY
2009
Springer
15 years 6 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
Zoltán Fülöp, Magnus Steinby
IJCAI
2007
15 years 28 days ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos