DeepBrowse: Similarity-Based Browsing Through Large Lists (Extended Abstract)

• Published in: Similarity Search and Applications pp. 300 - 314
• Main Authors: Chen, Haochen, Anantharam, Arvind Ram, Skiena, Steven
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: DeepWalk; Graph Embedding; Serendipitous Browsing; Similar Permutation; Wikipedia Page
• ISBN: 9783319684734; 3319684736
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-68474-1_21

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.