Sciweavers

2383 search results - page 88 / 477
» Finding Representative Set from Massive Data
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 10 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
PAKDD
2005
ACM
161views Data Mining» more  PAKDD 2005»
15 years 3 months ago
Online Algorithms for Mining Inter-stream Associations from Large Sensor Networks
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
K. K. Loo, Ivy Tong, Ben Kao
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
15 years 3 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
15 years 11 months ago
Stream Monitoring under the Time Warping Distance
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
Yasushi Sakurai, Christos Faloutsos, Masashi Yamam...
EMNLP
2008
14 years 11 months ago
Automatic Set Expansion for List Question Answering
This paper explores the use of set expansion (SE) to improve question answering (QA) when the expected answer is a list of entities belonging to a certain class. Given a small set...
Richard C. Wang, Nico Schlaefer, William W. Cohen,...