Sciweavers

99 search results - page 13 / 20
» Efficiently evaluating complex boolean expressions
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 8 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
ICLP
2009
Springer
14 years 9 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen
ATAL
2010
Springer
13 years 9 months ago
A logic-based representation for coalitional games with externalities
We consider the issue of representing coalitional games in multiagent systems that exhibit externalities from coalition formation, i.e., systems in which the gain from forming a c...
Tomasz P. Michalak, Dorota Marciniak, Marcin Szamo...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010