DeepBrowse: Similarity-Based Browsing Through Large Lists (Extended Abstract)
We propose a new approach for browsing through large lists in the absence of a predefined hierarchy. DeepBrowse is defined by the interaction of two fixed, globally-defined permutations on the space of objects: one ordering the items by similarity, the second based on magnitude or importance. We dem...
Saved in:
Published in | Similarity Search and Applications pp. 300 - 314 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
Cham
Springer International Publishing
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We propose a new approach for browsing through large lists in the absence of a predefined hierarchy. DeepBrowse is defined by the interaction of two fixed, globally-defined permutations on the space of objects: one ordering the items by similarity, the second based on magnitude or importance. We demonstrate this paradigm through our WikiBrowse app for discovering interesting Wikipedia pages, which enables the user to scan similar related entities and then increase depth once a region of interest has been found.
Constructing good similarity orders of large collections of complex objects is a challenging task. Graph embeddings are assignments of vertices to points in space that reflect the structure of any underlying similarity or relatedness network. We propose the use of graph embeddings (DeepWalk) to provide the features to order items by similarity.
The problem of ordering items in a list by similarity is naturally modeled by the Traveling Salesman Problem (TSP), which seeks the minimum-cost tour visiting the complete set of items. We introduce a new variant of TSP designed to more effectively order vertices so as to reflect longer-range similarity. We present interesting combinatorial and algorithmic properties of this formulation, and demonstrate that it works effectively to organize large product universes. |
---|---|
AbstractList | We propose a new approach for browsing through large lists in the absence of a predefined hierarchy. DeepBrowse is defined by the interaction of two fixed, globally-defined permutations on the space of objects: one ordering the items by similarity, the second based on magnitude or importance. We demonstrate this paradigm through our WikiBrowse app for discovering interesting Wikipedia pages, which enables the user to scan similar related entities and then increase depth once a region of interest has been found.
Constructing good similarity orders of large collections of complex objects is a challenging task. Graph embeddings are assignments of vertices to points in space that reflect the structure of any underlying similarity or relatedness network. We propose the use of graph embeddings (DeepWalk) to provide the features to order items by similarity.
The problem of ordering items in a list by similarity is naturally modeled by the Traveling Salesman Problem (TSP), which seeks the minimum-cost tour visiting the complete set of items. We introduce a new variant of TSP designed to more effectively order vertices so as to reflect longer-range similarity. We present interesting combinatorial and algorithmic properties of this formulation, and demonstrate that it works effectively to organize large product universes. |
Author | Skiena, Steven Anantharam, Arvind Ram Chen, Haochen |
Author_xml | – sequence: 1 givenname: Haochen surname: Chen fullname: Chen, Haochen – sequence: 2 givenname: Arvind Ram surname: Anantharam fullname: Anantharam, Arvind Ram – sequence: 3 givenname: Steven surname: Skiena fullname: Skiena, Steven email: skiena@cs.stonybrook.edu |
BookMark | eNpVkDtPwzAUhQ0UiVLyDxgywmDw49YPtraUhxTEQJktx3bTQEkqO6jw70kLC9ORvnN1dfSdokHTNgGhc0quKCHyWkuFOeZUY6FAAqaG0QOU9Zj3cM_oIRpSQSnmHPTRv47DAA0JJwxrCfwEZSm9EUKokoIoNkRPtyFsprHdpnCTv9Qf9drGuvvGU5uCz_dF3VT5YhXbz2qVFzZWIS_q1KX8Yv7Vhcb3Z5MyddG67vIMHS_tOoXsL0fo9W6-mD3g4vn-cTYpsGOgOwxSlNp6rySUWkkN3jO1JMCsc8H58ZgxJjQ4R2SpgVPnQAQlCA3gLJNjPkLs92_axH5eiKZs2_dkKDE7Z6YXYLjpFZi9H7Nzxn8A2DFbTw |
CitedBy_id | crossref_primary_10_1186_s12859_023_05612_6 crossref_primary_10_3390_s23084168 |
ContentType | Book Chapter |
Copyright | Springer International Publishing AG 2017 |
Copyright_xml | – notice: Springer International Publishing AG 2017 |
DOI | 10.1007/978-3-319-68474-1_21 |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISBN | 9783319684741 3319684744 |
EISSN | 1611-3349 |
Editor | Beecks, Christian Kröger, Peer Seidl, Thomas Borutta, Felix |
Editor_xml | – sequence: 1 givenname: Christian surname: Beecks fullname: Beecks, Christian email: christian.beecks@fit.fraunhofer.de – sequence: 2 givenname: Felix surname: Borutta fullname: Borutta, Felix email: borutta@dbs.ifi.lmu.de – sequence: 3 givenname: Peer surname: Kröger fullname: Kröger, Peer email: kroeger@dbs.ifi.lmu.de – sequence: 4 givenname: Thomas surname: Seidl fullname: Seidl, Thomas email: seidl@dbs.ifi.lmu.de |
EndPage | 314 |
GroupedDBID | -DT -GH -~X 1SB 29L 2HA 2HV 5QI 875 AASHB ABMNI ACGFS ADCXD AEFIE ALMA_UNASSIGNED_HOLDINGS EJD F5P FEDTE HVGLF LAS LDH P2P RIG RNI RSU SVGTG VI1 ~02 |
ID | FETCH-LOGICAL-c249t-476b9add874b98794dd28f042accecd55222694cc07b9431cc46e8601e4ca2753 |
ISBN | 9783319684734 3319684736 |
ISSN | 0302-9743 |
IngestDate | Tue Oct 01 18:44:20 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c249t-476b9add874b98794dd28f042accecd55222694cc07b9431cc46e8601e4ca2753 |
PageCount | 15 |
ParticipantIDs | springer_books_10_1007_978_3_319_68474_1_21 |
PublicationPlace | Cham |
PublicationPlace_xml | – name: Cham |
PublicationSeriesSubtitle | Information Systems and Applications, incl. Internet/Web, and HCI |
PublicationSeriesTitle | Lecture Notes in Computer Science |
PublicationSeriesTitleAlternate | Lect.Notes Computer |
PublicationSubtitle | 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings |
PublicationTitle | Similarity Search and Applications |
Publisher | Springer International Publishing |
Publisher_xml | – name: Springer International Publishing |
RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Weikum, Gerhard Hutchison, David Tygar, Doug |
RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug – sequence: 12 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard |
SSID | ssj0001876082 ssj0002792 |
Score | 2.038283 |
Snippet | We propose a new approach for browsing through large lists in the absence of a predefined hierarchy. DeepBrowse is defined by the interaction of two fixed,... |
SourceID | springer |
SourceType | Publisher |
StartPage | 300 |
SubjectTerms | DeepWalk Graph Embedding Serendipitous Browsing Similar Permutation Wikipedia Page |
Title | DeepBrowse: Similarity-Based Browsing Through Large Lists (Extended Abstract) |
URI | http://link.springer.com/10.1007/978-3-319-68474-1_21 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Jb9QwFLaGcuPALkAF-cABFBl5EmcxEocAg0bVtKcp6i3yFqlCnSIaekD8eN7zMklneimXaJRZ7Hmf81Z_z4S8zXNTVVb0TNqeM9HIiinOFXM8172bN4b77vrHJ9XyVBydlWez2d8pu2TQH8yfW3kl_4Mq3ANckSV7B2S3Pwo34DXgC1dAGK47zu_NNGvgcJxfnENYil502DPs6wDtpCA9lu6DblkqPB5ruxpa3AOD_Zr9kmhBZyBXUV1sky4_4LFXcSvYdfpeGPyrcz8xgg_U9nEq7DNYRZv5tzAJsY7HAK1ww3m2gjXls7yLmHrPWo2pFjOkhASKzV19WsXKxsnl4DeMZenwiaSL9hKTO6nNMbt2I5ItUBWApYyZzcjoAm0N8U5QgC4o6ArbLhZCTpRuwfnEfheBlLpnGqa7QZC5haMJNu-wC8G9WoJGvN8ujlbfxwwdGArejM3IsNViqEmFWSFTKM26Cr2cxn8xYWneNuRe3d27M-tH5AFSXChyT0Boj8nMbZ6Qh0nGNMr4KTkeYf5Id0GmCWQaQaYeZOpBpu8SxDRB_P4ZOf22WH9Zsnj-BjMQlA9M1JWWYP-aWmjZgOK2Nm960PLKGGdsCa478qCN4bWW4IgaIyrXQITvhFE5xMHPycHmcuNeECrn4CbzUnOrFFiNUhe9La2rIb4rTCnlS5IleXT4RF11qZ02SK8rOpBe56XXofRe3enTh-Rg-PXbvQbncdBvIsr_AG37aQ0 |
link.rule.ids | 785,786,790,799,27958 |
linkProvider | Library Specific Holdings |
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%3Abook&rft.genre=bookitem&rft.title=Similarity+Search+and+Applications&rft.au=Chen%2C+Haochen&rft.au=Anantharam%2C+Arvind+Ram&rft.au=Skiena%2C+Steven&rft.atitle=DeepBrowse%3A+Similarity-Based+Browsing+Through+Large+Lists+%28Extended+Abstract%29&rft.series=Lecture+Notes+in+Computer+Science&rft.pub=Springer+International+Publishing&rft.isbn=9783319684734&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=300&rft.epage=314&rft_id=info:doi/10.1007%2F978-3-319-68474-1_21 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon |