661 search results - page 111 / 133 » Scalable Parallel Data Mining for Association Rules |
GFKL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Solving conflicts between overlapping databases requires an understanding of the reasons that lead to the inconsistencies. Provided that conflicts do not occur randomly b...
DAWAK
1999
Springer
13 years 12 months ago
1999
Springer
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
DKE
2006
13 years 7 months ago
2006
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
WISE
2002
Springer
14 years 16 days ago
2002
Springer
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...