Sciweavers

11160 search results - page 1802 / 2232
» Incompleteness in a General Setting
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 8 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
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 8 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
16 years 8 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 8 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
« Prev « First page 1802 / 2232 Last » Next »