Sciweavers

2492 search results - page 430 / 499
» On the General Signature Trees
Sort
View
SIROCCO
2010
13 years 10 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
LREC
2008
142views Education» more  LREC 2008»
13 years 10 months ago
Enriching Frame Semantic Resources with Dependency Graphs
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
Hagen Fürstenau
LWA
2007
13 years 10 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
13 years 10 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo
SEBD
2008
169views Database» more  SEBD 2008»
13 years 10 months ago
Clustering the Feature Space
Abstract Dino Ienco and Rosa Meo Dipartimento di Informatica, Universit`a di Torino, Italy In this paper we propose and test the use of hierarchical clustering for feature selectio...
Dino Ienco, Rosa Meo