Sciweavers

5785 search results - page 1121 / 1157
» Approximability of Probability Distributions
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 1 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
16 years 1 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 1 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 1 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 1 months ago
Sequential cost-sensitive decision making with reinforcement learning
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
« Prev « First page 1121 / 1157 Last » Next »