Sciweavers

147 search results - page 16 / 30
» Very sparse random projections
Sort
View
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 1 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
NIPS
2007
13 years 9 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...
TMI
2008
138views more  TMI 2008»
13 years 7 months ago
Accurate Event-Driven Motion Compensation in High-Resolution PET Incorporating Scattered and Random Events
With continuing improvements in spatial resolution of positron emission tomography (PET) scanners, small patient movements during PET imaging become a significant source of resolut...
Arman Rahmim, Katie Dinelle, Ju-Chieh Cheng, Mikha...
SPAA
2010
ACM
13 years 8 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SIGIR
2009
ACM
14 years 2 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...