Sciweavers

2513 search results - page 385 / 503
» Improving Generalization by Data Categorization
Sort
View
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 4 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
244
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 4 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
WWW
2010
ACM
15 years 11 months ago
Modeling relationship strength in online social networks
Previous work analyzing social networks has mainly focused on binary friendship relations. However, in online social networks the low cost of link formation can lead to networks w...
Rongjing Xiang, Jennifer Neville, Monica Rogati
DASFAA
2009
IEEE
203views Database» more  DASFAA 2009»
15 years 11 months ago
Adaptive Safe Regions for Continuous Spatial Queries over Moving Objects
Abstract. Continuous spatial queries retrieve a set of time-varying objects continuously during a given period of time. However, monitoring moving objects to maintain the correctne...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
ICFCA
2009
Springer
15 years 11 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...