Sciweavers

Share
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
9 years 4 months ago
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
Sergey Ioffe
ICDM
2010
IEEE
172views Data Mining» more  ICDM 2010»
9 years 4 months ago
Learning Attribute-to-Feature Mappings for Cold-Start Recommendations
Cold-start scenarios in recommender systems are situations in which no prior events, like ratings or clicks, are known for certain users or items. To compute predictions in such ca...
Zeno Gantner, Lucas Drumond, Christoph Freudenthal...
ICDM
2010
IEEE
212views Data Mining» more  ICDM 2010»
9 years 4 months ago
Modeling Information Diffusion in Implicit Networks
Social media forms a central domain for the production and dissemination of real-time information. Even though such flows of information have traditionally been thought of as diffu...
Jaewon Yang, Jure Leskovec
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
9 years 4 months ago
Abstraction Augmented Markov Models
Cornelia Caragea, Adrian Silvescu, Doina Caragea, ...
ICDM
2010
IEEE
178views Data Mining» more  ICDM 2010»
9 years 4 months ago
Exploiting Unlabeled Data to Enhance Ensemble Diversity
Ensemble learning aims to improve generalization ability by using multiple base learners. It is well-known that to construct a good ensemble, the base learners should be accurate a...
Min-Ling Zhang, Zhi-Hua Zhou
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
9 years 4 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
9 years 4 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
9 years 4 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
ICDM
2010
IEEE
167views Data Mining» more  ICDM 2010»
9 years 4 months ago
Averaged Stochastic Gradient Descent with Feedback: An Accurate, Robust, and Fast Training Method
On large datasets, the popular training approach has been stochastic gradient descent (SGD). This paper proposes a modification of SGD, called averaged SGD with feedback (ASF), tha...
Xu Sun, Hisashi Kashima, Takuya Matsuzaki, Naonori...
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
9 years 4 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
books