NDLI: Parameter-free and domain-independent similarity search with diversity

Please wait, while we are loading the content...

Making sense of big data with the Berkeley data analytics stack

Education and career paths for data scientists

On the combination of relative clustering validity criteria

Providing multi-scale consistency for multi-scale geospatial data

Fast computation of approximate biased histograms on sliding windows over data streams

Search and result presentation in scientific workflow repositories

GPS: a graph processing system

Accelerating gene context analysis using bitmaps

Learning to explore scientific workflow repositories

A fast handshake join implementation on FPGA with adaptive merging network

Computational challenges in next-generation genomics

Parameter-free and domain-independent similarity search with diversity

Reasoning about RFID-tracked moving objects in symbolic indoor spaces

Multi-scale dissemination of time series data

Tuning large scale deduplication with reduced effort

RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs

The open connectome project data cluster: scalable analysis and vision for high-throughput neuroscience

Best of both worlds: relational databases and statistics

Adaptive exploration for large-scale protein analysis in the molecular dynamics database

A multidimensional data model with subcategories for flexibly capturing summarizability

Towards a universal tracking database

Multi-query scheduling for time-critical data stream applications

HmSearch: an efficient hamming distance query processing algorithm

SMIX: self-managing indexes for dynamic workloads

Real-time collaborative analysis with (almost) pure SQL: a case study in biogeochemical oceanography

Data management systems on GPUs: promises and challenges

Parallel online aggregation in action

Nearest group queries

GIPSY: joining spatial datasets with contrasting density

Learning uncertainty models from weather forecast performance databases using quantile regression

pcApriori: scalable apriori for multiprocessor systems

Inverted indices for particle tracking in petascale cosmological simulations

Optimizing fastquery performance on lustre file system

Nesting the earth mover's distance for effective cluster tracing

Astronomical data processing in EXTASCID

Publishing trajectories with differential privacy guarantees

Shortlisting top-K assignments

Graywulf: a platform for federated scientific databases and services

Semantic query reformulation: the NIF experience

Data vaults: a database welcome to scientific file repositories

Autonomous clustering for wireless sensor networks

Forecasting in hierarchical environments

Towards efficient discovery of coverage patterns in transactional databases

Bulk sorted access for efficient top-k retrieval

DoS: an efficient scheme for the diversification of multiple search results

Research lattices: towards a scientific hypothesis data model

Sharing confidential data for algorithm development by multiple imputation

Mining multidimensional contextual outliers from categorical relational data

Parameter-free and domain-independent similarity search with diversity

Content Provider	ACM Digital Library
Author	Traina, Caetano Oliveira, Willian D. Ferreira, Monica R. P. Traina, Agma J. M. Santos, Lucio F. D.
Abstract	New operators to execute similarity-based queries over multimedia data stored in Database Management Systems are increasingly demanded. However, searching in very large datasets, the basic operators often return elements too much similar both to the query center and to themselves, reducing the answer's utility. In this paper, we tackle the problem of providing diversity to similarity query results, and define techniques to assure that each element in the result set is different enough from the others. Existing techniques compel the user to define either a parameter to trade among similarity and diversity or a minimum similarity between result elements. Distinctly, our approach provides similarity queries with diversification using the influence concept, which automatically estimates the inherent diversity between the result set elements requiring no user-defined parameters. Furthermore, our technique can be applied over any data represented in a metric space, so it is both parameter and application-domain independent. The "Better Results with Influence Diversification" (BRID) technique is the basis to the k-Diverse Nearest Neighbor $(BRID_{k})$ and to the Range Diverse $(BRID_{r})$ algorithms, which execute k-nearest neighbor and range queries with diversification, showing that the technique can be applied to diversify any type of similarity queries. We also define a way to measure the diversification degree in a result set. Through a detailed experimental evaluation using our approach, we show that BRID outperforms the existing methods regarding both query diversification quality and execution times, being at least two orders of magnitude faster than the best existing approaches.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450319218
DOI	10.1145/2484838.2484854
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-07-29
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Result diversification Similarity searches
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Combine-and-conquer: improving the diversity in similarity search through influence sampling

Diversification for multi-domain result sets

Explicit diversification of image search

Multidimensional search result diversification: diverse search results for diverse users

Intent-aware search result diversification

Improving personalized web search using result diversification

Multi-dimensional search result diversification

Diversity by proportionality: an election-based approach to search result diversification

Exploiting query reformulations for web search result diversification

Parameter-free and domain-independent similarity search with diversity

Similar Documents

Combine-and-conquer: improving the diversity in similarity search through influence sampling

Diversification for multi-domain result sets

Explicit diversification of image search

Multidimensional search result diversification: diverse search results for diverse users

Intent-aware search result diversification

Improving personalized web search using result diversification

Multi-dimensional search result diversification

Diversity by proportionality: an election-based approach to search result diversification

Exploiting query reformulations for web search result diversification

Parameter-free and domain-independent similarity search with diversity