Sciweavers

1146 search results - page 158 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
SAC
2004
ACM
14 years 1 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
IEEEHPCS
2010
13 years 6 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ICLP
2005
Springer
14 years 1 months ago
An Optimised Semantic Web Query Language Implementation in Prolog
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...
Jan Wielemaker
MOBIDE
2010
ACM
13 years 8 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...