Sciweavers

513 search results - page 44 / 103
» Efficient search for association rules
Sort
View
DAWAK
2010
Springer
14 years 10 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
WISE
2002
Springer
15 years 2 months ago
Log Mining to Improve the Performance of Site Search
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...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
15 years 3 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
ICSE
2007
IEEE-ACM
15 years 9 months ago
Suade: Topology-Based Searches for Software Investigation
The investigation of a software system prior to a modification task often constitutes an important fraction of the overall effort associated with the task. We present Suade, an Ec...
Frédéric Weigand Warr, Martin P. Rob...
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...