Sciweavers

953 search results - page 151 / 191
» Mining functional dependencies from data
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 12 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
ICSOC
2010
Springer
13 years 8 months ago
Incorporating Expectations as a Basis for Business Service Selection
Abstract. The collaborative creation of value is the central tenet of services science. In particular, then, the quality of a service encounter would depend on the mutual expectati...
Adel M. ElMessiry, Xibin Gao, Munindar P. Singh
CIKM
2007
Springer
14 years 4 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
RSFDGRC
2007
Springer
124views Data Mining» more  RSFDGRC 2007»
14 years 4 months ago
Supporting Literature Exploration with Granular Knowledge Structures
Reading and literature exploration are important tasks of scientific research. However, conventional retrieval systems provide limited support for these tasks by concentrating on ...
Yiyu Yao, Yi Zeng, Ning Zhong
CIKM
2009
Springer
14 years 4 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu