Progressive Skylining over Web-Accessible Database Abstract (2008)
Eric Lo, Kevin Yip, King-ip Lin, David W. Cheung
Skyline queries return a set of interesting data points that are not dominated by any other point on all dimensions. Most of the existing algorithms focus on skyline computation in centralized...
Xiong Wang, King-ip Lin, Dennis Shasha, Bruce A. Shapiro, Kaizhong Zhang
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in such a way that the...
Ffl Xiong Wang, Xiong Wang, Xiong Wang, King-ip Lin, ...
ditor, Combinatorial Pattern Matching, pages 104 -- 117, Lecture Notes in Computer Science, SpringerVerlag, 1998. ffl Xiong Wang, Jason T.L. Wang, Dennis Shasha, Bruce Shapiro, Sitaram Dikshitulu,...
Adaptive Generalized Estimation Equation with Bayes Classifier for the Job Assignment Problem (2007)
Yulan Liang, King-ip Lin, Arpad Kelemen
Abstract. We propose combining advanced statistical approaches with data mining techniques to build classifiers to enhance decision-making models for the job assignment problem. Adaptive Generalized...
index structure for improving closest pairs and related join queries in spatial databases
TOOL to GENERATE a LOCAL INTERNET WEATHER REPORT (2007)
Fabio González, Nivedita Sumi Majumdar, King-ip Lin, Dipankar Dasgupta
This paper reports the results of some experiments conducted to measure the Internet congestion, viewed from a local perspective. A user-friendly graphical tool was developed to reflect the “local...
ANN-tree: An index for ecient approximate nearest neighbor search
Feature Normalization for Video Indexing and Retrieval (2007)
Kobla, Vikrant, Doermann, David, Lin, King-Ip, Faloutsos, Christos
Fast and efficient storage, browsing, indexing, and retrieval of video is necessary for the development of various multimedia database applications. Given that video is typically stored efficiently...
Modeling Student Performance to Enhance the Pedagogy of AutoTutor. In (2003)
Tanner Jackson, Eric Mathews, King-ip Lin, Andrew Olney, Art Graesser
Abstract. The Tutoring Research Group from the University of Memphis has developed a pedagogically effective Intelligent Tutoring System (ITS), called AutoTutor, that implements conversational dialog...
An Index Structure for Efficient Reverse Nearest Neighbor Queries (2001)
The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Just like the Nearest Neighbor (NN) queries, the RNN queries appear...
An index structure for data mining and clustering (2000)
Xiong Wang, King-ip Lin, Dennis Shasha, Bruce A. Shapiro, Kaizhong Zhang
Abstract. In this paper we present an index structure, called Metric-Map, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in such away that the...
An index structure for data mining and clustering (2000)
Xiong Wang, King-ip Lin, Dennis Shasha, Bruce A. Shapiro, Kaizhong Zhang
Abstract. In this paper we present an index structure, called Metric-Map, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in such a way that the...
Evaluating A Class of Distance-Mapping Algorithms for Data Mining and Clustering (1999)
Xiong Wang, King-ip Lin, Dennis Shasha, Bruce A. Shapiro, Kaizhong Zhang
A distance-mapping algorithm takes a set of objects and a distance metric and then maps those objects to a Euclidean or pseudo-Euclidean space in such a way that the distances among objects are...
Rule Discovery From Time Series (1998)
Gautam Das, King-ip Lin, Heikki Mannila, Gopal Renganathan, Padhraic Smyth
We consider the problem of finding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple example is a rule such...
Faloutsos, Christos, Lin, King-Ip (David)
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert rJag91]....
Faloutsos, Christos, Lin, King-Ip (David)
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert rJag91]....
Christos Faloutsos, King-Ip (David) Lin
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25]....
Rakesh Agrawal, King-ip Lin, Harpreet S. Sawhney, Kyuseok Shim
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of...
Rakesh Agrawal, King-ip Lin, Harpreet S. Sawhney, Kyuseok Shim
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of...
Christos Faloutsos, King-Ip (David) Lin
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]....
Rakesh Agrawal, King-ip Lin, Harpreet S. Sawhney, Kyuseok Shim
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of...
The TV-tree -- an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
The TV-tree - an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...