Sciweavers

4560 search results - page 45 / 912
» Finding Data in the Neighborhood
Sort
View
ISMIS
2005
Springer
14 years 1 months ago
A Probabilistic Approach to Finding Geometric Objects in Spatial Datasets of the Milky Way
Data from the Sloan Digital Sky Survey has given evidence of structures within the Milky Way halo from other nearby galaxies. Both the halo and these structures are approximated by...
Jon Purnell, Malik Magdon-Ismail, Heidi Jo Newberg
BMVC
2001
13 years 10 months ago
Finding Paths in Video Sequences
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
Dimitrios Makris, Tim Ellis
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
14 years 18 days ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
CCCG
2008
13 years 9 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...