COMPARISON-BASED ACTIVE SEARCHING/LEARNING

A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few compari...

Full description

Saved in:
Bibliographic Details
Main Authors IOANNIDIS, EFSTRATIOS, MASSOULIE, LAURENT
Format Patent
LanguageEnglish
French
German
Published 18.03.2015
Subjects
Online AccessGet full text

Cover

Loading…
Abstract A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few comparisons. The so-called rank-net strategy for noiseless user feedback is described. For target distributions with a bounded doubling constant, rank-net finds the target in a number of steps close to the entropy of the target distribution and hence of the optimum. The case of noisy user feedback is also considered. In that context a variant of rank-nets is also described, for which performance bounds within a slowly growing function (doubly logarithmic) of the optimum are found. Numerical evaluations on movie datasets show that rank-net matches the search efficiency of generalized binary search while incurring a smaller computational cost.
AbstractList A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few comparisons. The so-called rank-net strategy for noiseless user feedback is described. For target distributions with a bounded doubling constant, rank-net finds the target in a number of steps close to the entropy of the target distribution and hence of the optimum. The case of noisy user feedback is also considered. In that context a variant of rank-nets is also described, for which performance bounds within a slowly growing function (doubly logarithmic) of the optimum are found. Numerical evaluations on movie datasets show that rank-net matches the search efficiency of generalized binary search while incurring a smaller computational cost.
Author MASSOULIE, LAURENT
IOANNIDIS, EFSTRATIOS
Author_xml – fullname: IOANNIDIS, EFSTRATIOS
– fullname: MASSOULIE, LAURENT
BookMark eNrjYmDJy89L5WTQcvb3DXAM8gz299N1cgx2dVFwdA7xDHNVCHZ1DHL28PRz1_cBsvyADB4G1rTEnOJUXijNzaDg5hri7KGbWpAfn1pckJicmpdaEu8aYGRhYm5maehoaEyEEgD4xiYX
ContentType Patent
DBID EVB
DatabaseName esp@cenet
DatabaseTitleList
Database_xml – sequence: 1
  dbid: EVB
  name: esp@cenet
  url: http://worldwide.espacenet.com/singleLineSearch?locale=en_EP
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Medicine
Chemistry
Sciences
Physics
DocumentTitleAlternate RECHERCHE/APPRENTISSAGE ACTIFS SUR LA BASE DE COMPARAISONS
VERGLEICHSBASIERTES AKTIVES SUCHEN/LERNEN
ExternalDocumentID EP2847691A1
GroupedDBID EVB
ID FETCH-epo_espacenet_EP2847691A13
IEDL.DBID EVB
IngestDate Fri Jul 19 14:32:14 EDT 2024
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
French
German
LinkModel DirectLink
MergedId FETCHMERGED-epo_espacenet_EP2847691A13
Notes Application Number: EP20130724116
OpenAccessLink https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20150318&DB=EPODOC&CC=EP&NR=2847691A1
ParticipantIDs epo_espacenet_EP2847691A1
PublicationCentury 2000
PublicationDate 20150318
PublicationDateYYYYMMDD 2015-03-18
PublicationDate_xml – month: 03
  year: 2015
  text: 20150318
  day: 18
PublicationDecade 2010
PublicationYear 2015
RelatedCompanies THOMSON LICENSING
RelatedCompanies_xml – name: THOMSON LICENSING
Score 2.9718363
Snippet A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to...
SourceID epo
SourceType Open Access Repository
SubjectTerms CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Title COMPARISON-BASED ACTIVE SEARCHING/LEARNING
URI https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20150318&DB=EPODOC&locale=&CC=EP&NR=2847691A1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1JS8NAFH6Uut40Kq0bOUgOQmjTJJPkECSrrZiFtpbeSpYJ9JIWE_Hv-yam1YveHm9gNuZt8743A_CgyXQoF1QRNUNXRLQQuZiQJBcLouuZktERJaw4OQjJ-E15WarLDqx3tTDNO6GfzeOIKFEZynvd6OvtzyWW22Arq0G6RtbmyZ-brtBGx-jd4BkVXNv04siNHMFxkBLCqcm0MDEkCwOlA_SiNYb-8hY2K0rZ_rYo_hkcxthZWZ9Dh5YcnDi7j9c4OA7afDcHRw1AM6uQ2QphdQGPThTE1nQyQy1oWzPP5RkSZOHx36mfSfg8eEUqROISeN-bO2MRh1_tl7ry4v1E5SvolpuS9oBX84KStNBYXayiyiRJ6UhN1GJoaDSTCqMP_T-7uf6n7QZO2Z4xSJWk30K3fv-gd2hj6_S-2Z0vpCZ8Qg
link.rule.ids 230,309,783,888,25578,76884
linkProvider European Patent Office
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfR3LToNAcNLUR70palqfHAwHE9IHsMChMWWhFgVK2tr0RngsSS-0sRh_31lsqxe9TWaT2d3JzmN3HgvwoCuso-RMlXXTUGW0EJkckziTc2IYqZqyHiO8ONkPyOhNfVloixosd7UwVZ_Qz6o5IkpUivJeVvp6_fOIZVe5lZt2skTU6mk469vS9naM3g2eUcm2-k44tsdUohQhKZj0uRYmZneAF6UD9LAN3mbfmVu8KGX926IMT-EwRGJFeQY1VgjQoLuP1wQ49rfxbgGOqgTNdIPIrRBuzuGRjv1wMHGnqAWtwdSxRZ4JMnfE79CPGzy3PYQCBC5AHDozOpJx-mi_1cgJ9wtVLqFerArWBFHLckaSXOd1saqmkDhhPS3W8o6ps7Sbmy1o_Unm6p-xe2iMZr4XeW7weg0nnH88vapr3EC9fP9gt2hvy-Su4tQXn3J_Mg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&rft.title=COMPARISON-BASED+ACTIVE+SEARCHING%2FLEARNING&rft.inventor=IOANNIDIS%2C+EFSTRATIOS&rft.inventor=MASSOULIE%2C+LAURENT&rft.date=2015-03-18&rft.externalDBID=A1&rft.externalDocID=EP2847691A1