240 search results - page 18 / 48 » On Efficient Construction of Decision Trees from Large Datab... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
CIDR
2009
13 years 8 months ago
2009
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of ...
CSDA
2008
13 years 7 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Push-based data delivery requires knowledge of user interests for making scheduling, bandwidthallocation, and routing decisions. Such information is maintained as user profiles. W...
CIKM
1997
Springer
13 years 11 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...