Sciweavers

618 search results - page 79 / 124
» Aggregated Subset Mining
Sort
View
MSR
2005
ACM
15 years 5 months ago
Recovering system specific rules from software repositories
One of the most successful applications of static analysis based bug finding tools is to search the source code for violations of system-specific rules. These rules may describe h...
Chadd C. Williams, Jeffrey K. Hollingsworth
AI
2001
Springer
15 years 4 months ago
Learning Bayesian Belief Network Classifiers: Algorithms and System
Abstract. This paper investigates the methods for learning predictive classifiers based on Bayesian belief networks (BN) – primarily unrestricted Bayesian networks and Bayesian m...
Jie Cheng, Russell Greiner
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 12 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
ICTAI
2010
IEEE
14 years 9 months ago
Ontology-guided Extraction of Complex Nested Relationships
Many applications call for methods to enable automatic extraction of structured information from unstructured natural language text. Due to inherent challenges of natural language ...
Sushain Pandit, Vasant Honavar
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
14 years 6 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...