Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data containing both continuous and discrete variables. We describe ...
Information distillation techniques are used to analyze and interpret large volumes of speech and text archives in multiple languages and produce structured information of interes...
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...