Sciweavers

4972 search results - page 249 / 995
» Ranking on graph data
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
Yoram Bachrach, Ralf Herbrich
WWW
2011
ACM
15 years 1 months ago
A demo search engine for products
Most product search engines today build on models of relevance devised for information retrieval. However, the decision mechanism that underlies the process of buying a product is...
Beibei Li, Anindya Ghose, Panagiotis G. Ipeirotis
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
16 years 7 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
163
Voted
MOBIQUITOUS
2007
IEEE
16 years 29 days ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....