Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
During the last decade, multimedia databases have become increasingly important in many
application areas such as medicine, CAD, geography, and molecular biology. An important …
application areas such as medicine, CAD, geography, and molecular biology. An important …
Pathsim: Meta path-based top-k similarity search in heterogeneous information networks
Similarity search is a primitive operation in database and Web search engines. With the
advent of large-scale heterogeneous information networks that consist of multi-typed …
advent of large-scale heterogeneous information networks that consist of multi-typed …
Mining heterogeneous information networks: a structural analysis approach
Most objects and data in the real world are of multiple types, interconnected, forming
complex, heterogeneous but often semi-structured information networks. However, most …
complex, heterogeneous but often semi-structured information networks. However, most …
On the surprising behavior of distance metrics in high dimensional space
In recent years, the effect of the curse of high dimensionality has been studied in great detail
on several problems such as clustering, nearest neighbor search, and indexing. In high …
on several problems such as clustering, nearest neighbor search, and indexing. In high …
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
As a prolific research area in data mining, subspace clustering and related problems
induced a vast quantity of proposed solutions. However, many publications compare a new …
induced a vast quantity of proposed solutions. However, many publications compare a new …
Ranking-based clustering of heterogeneous information networks with star network schema
A heterogeneous information network is an information network composed of multiple types
of objects. Clustering on such a network may lead to better understanding of both hidden …
of objects. Clustering on such a network may lead to better understanding of both hidden …
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
HV Jagadish, BC Ooi, KL Tan, C Yu… - ACM Transactions on …, 2005 - dl.acm.org
In this article, we present an efficient B+-tree based indexing method, called iDistance, for K-
nearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the …
nearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the …
Hetesim: A general framework for relevance measure in heterogeneous networks
Similarity search is an important function in many applications, which usually focuses on
measuring the similarity between objects with the same type. However, in many scenarios …
measuring the similarity between objects with the same type. However, in many scenarios …
A survey of query result diversification
Nowadays, in information systems such as web search engines and databases, diversity is
becoming increasingly essential and getting more and more attention for improving users' …
becoming increasingly essential and getting more and more attention for improving users' …
[PDF][PDF] Voronoi-based k nearest neighbor search for spatial network databases
M Kolahdouzan, C Shahabi - … of the Thirtieth international conference on …, 2004 - vldb.org
A frequent type of query in spatial networks (eg, road networks) is to find the K nearest
neighbors (KNN) of a given query object. With these networks, the distances between …
neighbors (KNN) of a given query object. With these networks, the distances between …