Sciweavers

2097 search results - page 346 / 420
» Knowledge Base Maintenance through Knowledge Representation
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 10 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
AAAI
2010
14 years 10 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
ICGI
2010
Springer
14 years 9 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
IAJIT
2010
155views more  IAJIT 2010»
14 years 9 months ago
Evaluation of text clustering methods using wordnet
: The increasing number of digitized texts presently available notably on the Web has developed an acute need in text mining techniques. Clustering systems are used more and more o...
Abdelmalek Amine, Zakaria Elberrichi, Michel Simon...
TKDE
2011
176views more  TKDE 2011»
14 years 6 months ago
Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems
—This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experienc...
Haifeng Chen, Wenxuan Zhang, Guofei Jiang