Sciweavers

643 search results - page 105 / 129
» Merge-Based Computation of Minimal Generators
Sort
View
CIKM
2008
Springer
15 years 1 months ago
Mining conceptual graphs for knowledge acquisition
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...
Milagros Fernández, Eric Villemonte de la C...
AAAI
2006
15 years 18 days ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
NIPS
2004
15 years 17 days ago
Parametric Embedding for Class Visualization
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
Tomoharu Iwata, Kazumi Saito, Naonori Ueda, Sean S...
P2PKM
2004
15 years 17 days ago
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
Giovanni Tummarello, Christian Morbidoni, Joackin ...
ICMLA
2003
15 years 17 days ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios