Sciweavers

571 search results - page 20 / 115
» Clustering Objects on a Spatial Network
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 9 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
IGIS
1994
156views GIS» more  IGIS 1994»
14 years 1 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
MASS
2010
157views Communications» more  MASS 2010»
13 years 7 months ago
Spatial extension of the Reality Mining Dataset
Data captured from a live cellular network with the real users during their common daily routine help to understand how the users move within the network. Unlike the simulations wi...
Michal Ficek, Lukas Kencl
ICDE
2006
IEEE
133views Database» more  ICDE 2006»
14 years 11 months ago
ViEWNet: Visual Exploration of Region-Wide Traffic Networks
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new app...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 3 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi