Sciweavers

1798 search results - page 198 / 360
» A Tree for All Seasons
Sort
View
AIIA
2003
Springer
14 years 26 days ago
Abduction in Classification Tasks
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
Maurizio Atzori, Paolo Mancarella, Franco Turini
WG
1995
Springer
14 years 22 days ago
Modular Decomposition of Hypergraphs
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
Paola Bonizzoni, Gianluca Della Vedova
ESEM
2007
ACM
13 years 11 months ago
Mining Software Evolution to Predict Refactoring
Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data ...
Jacek Ratzinger, Thomas Sigmund, Peter Vorburger, ...
ACL
2008
13 years 10 months ago
Phrase Chunking Using Entropy Guided Transformation Learning
Entropy Guided Transformation Learning (ETL) is a new machine learning strategy that combines the advantages of decision trees (DT) and Transformation Based Learning (TBL). In thi...
Ruy Luiz Milidiú, Cícero Nogueira do...
COMAD
2008
13 years 10 months ago
Concurrency Control in Distributed MRA Index Structure
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
Neha Singh, S. Sudarshan