KDD
2009
ACM
14 years 3 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
KDD
2009
ACM
14 years 3 months ago
2009
ACM
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
DAWAK
2009
Springer
14 years 3 months ago
2009
Springer
The appropriate choice of a method for imputation of missing data becomes especially important when the fraction of missing values is large and the data are of mixed type. The prop...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
Text streams are becoming more and more ubiquitous, in the forms of news feeds, weblog archives and so on, which result in a large volume of data. An effective way to explore the...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM