58 search results - page 4 / 12 » Competitive Freshness Algorithms for Wait-Free Data Objects |
IDA
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance b...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
As user demands become increasingly sophisticated, search engines today are competing in more than just returning document results from the Web. One area of competition is providi...
AAAI
2012
11 years 11 months ago
2012
In many real applications, especially those involving data objects with complicated semantics, it is generally desirable to discover the relation between patterns in the input spa...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
JMLR
2002
13 years 8 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...