Sciweavers

2262 search results - page 164 / 453
» Points with large quadrant-depth
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
APVIS
2010
15 years 8 months ago
Context preserving dynamic word cloud visualization
In this paper, we introduce a visualization method that couples a trend chart with word clouds to illustrate temporal content evolutions in a set of documents. Specifically, we us...
Weiwei Cui, Yingcai Wu, Shixia Liu, Furu Wei, Mich...
FIMI
2004
161views Data Mining» more  FIMI 2004»
15 years 7 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
NIPS
2003
15 years 7 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
AAAI
2000
15 years 7 months ago
Memory-Based Forecasting for Weather Image Patterns
A novel method and a framework called Memory-Based Forecasting are proposed to forecast complex and timevarying natural patterns with the goal of supporting experts' decision...
Kazuhiro Otsuka, Tsutomu Horikoshi, Satoshi Suzuki...