Sciweavers

DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
13 years 10 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
13 years 10 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...
VLDB
2004
ACM
125views Database» more  VLDB 2004»
13 years 10 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
DAGM
2004
Springer
13 years 10 months ago
A Probabilistic Framework for Robust and Accurate Matching of Point Clouds
We present a probabilistic framework for matching of point clouds. Variants of the ICP algorithm typically pair points to points or points to lines. Instead, we pair data points to...
Peter Biber, Sven Fleck, Wolfgang Straßer
AMAI
2004
Springer
13 years 10 months ago
Biased Minimax Probability Machine for Medical Diagnosis
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the probability of misclassification of future data points based on reliable ...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
SSD
2005
Springer
153views Database» more  SSD 2005»
13 years 10 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
ICPR
2008
IEEE
13 years 11 months ago
Semi-supervised marginal discriminant analysis based on QR decomposition
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
Rui Xiao, Pengfei Shi
ICPR
2008
IEEE
13 years 11 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
13 years 11 months ago
Organic Pie Charts
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
Fabian Mörchen
COMPLEX
2009
Springer
13 years 11 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang