240 search results - page 40 / 48 » On Efficient Construction of Decision Trees from Large Datab... |
HIPC
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
CIKM
2001
Springer
14 years 1 days ago
2001
Springer
Given a large number of search engines on the Internet, it is di cult for a person to determine which search engines could serve his/her information needs. A common solution is to...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...