Sciweavers

279 search results - page 44 / 56
» Methods for finding frequent items in data streams
Sort
View
WISE
2010
Springer
13 years 5 months ago
Neighborhood-Restricted Mining and Weighted Application of Association Rules for Recommenders
Abstract. Association rule mining algorithms such as Apriori were originally developed to automatically detect patterns in sales transactions and were later on also successfully ap...
Fatih Gedikli, Dietmar Jannach
BMCBI
2007
123views more  BMCBI 2007»
13 years 7 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
VL
2010
IEEE
218views Visual Languages» more  VL 2010»
13 years 6 months ago
Using Association Metrics to Help Users Navigate API Documentation
-- In the past decade there has been spectacular growth in the number and size of third-party libraries, frameworks, toolkits and other Application Programming Interfaces (APIs) av...
Daniel S. Eisenberg, Jeffrey Stylos, Andrew Faulri...
IPPS
2007
IEEE
14 years 1 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...
DEBU
2010
104views more  DEBU 2010»
13 years 7 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen