Sciweavers

5329 search results - page 61 / 1066
» The Weighted Majority Algorithm
Sort
View
ECIR
2007
Springer
13 years 9 months ago
Popularity Weighted Ranking for Academic Digital Libraries
Abstract. We propose a popularity weighted ranking algorithm for academic digital libraries that uses the popularity factor of a publication venue overcoming the limitations of imp...
Yang Sun, C. Lee Giles
MICAI
2007
Springer
14 years 1 months ago
Weighted Instance-Based Learning Using Representative Intervals
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
Octavio Gómez, Eduardo F. Morales, Jes&uacu...
PAMI
2007
202views more  PAMI 2007»
13 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 1 months ago
Intelligent Icons: Integrating Lite-Weight Data Mining and Visualization into GUI Operating Systems
The vast majority of visualization tools introduced so far are specialized pieces of software that are explicitly run on a particular dataset at a particular time for a particular...
Eamonn J. Keogh, Li Wei, Xiaopeng Xi, Stefano Lona...
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler