research-article

Ranking objects by following paths in entity-relationship graphs

Authors:

Sang-goo LeeAuthors Info & Claims

PIKM '11: Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management

Pages 11 - 18

https://doi.org/10.1145/2065003.2065008

Published: 28 October 2011 Publication History

Abstract

In this paper, we propose an object ranking method for search and recommendation. By selecting schema-level paths and following them in an entity-relationship graph, it can incorporate diverse semantics existing in the graph. Utilizing this kind of graph-based data models has been recognized as a reasonable way for dealing with heterogeneous data. However, previous work on ranking models using graphs has some limitations. In order to utilize a variety of semantics in multiple types of data, we define a schema path as a basic component of the ranking model. By following the path or a combination of paths, relevant objects could be retrieved or recommended. We present some preliminary experiments to evaluate our method. In addition, we discuss several interesting challenges that can be considered in future work.

References

[1]

G. Adomavicius and A. Tuzhilin. Multidimensional recommender systems: A data warehousing approach. In Electronic Commerce, volume 2232 of Lecture Notes in Computer Science, pages 180--192. Springer, 2001.

Digital Library

[2]

G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering (TKDE), 17(6):734--749, 2005.

Digital Library

[3]

G. Adomavicius and A. Tuzhilin. Context-aware recommender systems. In Recommender Systems Handbook. Springer, 2011.

[4]

O. Alonso, M. Gertz, and R. Baeza-Yates. Clustering and exploring search results using timeline constructions. In CIKM '09: Proceeding of the 18th ACM Conf. on Information and Knowledge Management, pages 97--106. ACM, 2009.

Digital Library

[5]

A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: authority-based keyword search in databases. In VLDB '04: Proceedings of the 30th Int'l Conf. on Very Large Data Bases, pages 564--575. VLDB Endowment, 2004.

Digital Library

[6]

S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik, S. Kumar, D. Ravichandran, and M. Aly. Video suggestion and discovery for youtube: taking random walks through the view graph. In WWW '08: Proceedings of the 17th Int'l Conf. on World Wide Web, pages 895--904. ACM, 2008.

Digital Library

[7]

S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW '98: Proceedings of the 7th Int'l Conf. on World Wide Web, 1998.

Digital Library

[8]

S.-H. Cha. Comprehensive survey on distance/similarity measures between probability density functions. Int'l Journal of Mathematical Models and Methods in Applied Sciences, 1(4):300--307, 2007.

[9]

Y. Chen, W. Wang, Z. Liu, and X. Lin. Keyword search on structured and semi-structured data. In SIGMOD '09: Proceedings of the 35th SIGMOD Int'l Conf. on Management of Data, pages 1005--1010. ACM, 2009.

Digital Library

[10]

B. Croft, D. Metzler, and T. Strohman. Search Engines: Information Retrieval in Practice. Addison-Wesley Publishing Company, 2009.

Digital Library

[11]

V. Dritsou, P. Constantopoulos, A. Deligiannakis, and Y. Kotidis. Optimizing query shortcuts in rdf databases. In ESWC '11: Proceedings of the 8th Extended Semantic Web Conf., volume 6644 of Lecture Notes in Computer Science, pages 77--92. Springer, 2011.

Digital Library

[12]

S. Elbassuoni, M. Ramanath, R. Schenkel, M. Sydow, and G. Weikum. Language-model-based ranking for queries on rdf-graphs. In CIKM '09: Proceeding of the 18th ACM Conf. on Information and Knowledge Management, pages 977--986. ACM, 2009.

Digital Library

[13]

J. Han, Y. Sun, X. Yan, and P. Yu. Mining knowledge from databases: an information network analysis approach. In SIGMOD '10: Proceedings of the 36th ACM SIGMOD Int'l Conf. on Management of Data, pages 1251--1252. ACM, 2010.

Digital Library

[14]

V. Hristidis and Y. Papakonstantinou. Discover: keyword search in relational databases. In VLDB '02: Proceedings of the 28th Int'l Conf. on Very Large Data Bases, pages 670--681. VLDB Endowment, 2002.

Digital Library

[15]

M. Kahng, S. Lee, and S.-g. Lee. Ranking in context-aware recommender systems. In WWW '11: Proceedings of the 20th Int'l Conf. Companion on World Wide Web, pages 65--66. ACM, 2011.

Digital Library

[16]

G. Kasneci, F. Suchanek, G. Ifrim, M. Ramanath, and G. Weikum. Naga: searching and ranking knowledge. In ICDE '08: Proceedings of the 24th IEEE Int'l Conf. on Data Engineering, pages 953--962. IEEE, 2008.

Digital Library

[17]

J. Kim and W. B. Croft. Ranking using multiple document types in desktop search. In SIGIR '10: Proceeding of the 33rd Int'l ACM SIGIR Conf. on Research and Development in Information Retrieval, pages 50--57. ACM, 2010.

Digital Library

[18]

G. Koutrika, B. Bercovitz, and H. Garcia-Molina. Flexrecs: expressing and combining flexible recommendations. In SIGMOD '09: Proceedings of the 35th SIGMOD Int'l Conf. on Management of Data, pages 745--758. ACM, 2009.

Digital Library

[19]

N. Lao and W. W. Cohen. Fast query execution for retrieval models based on path-constrained random walks. In KDD '10: Proceedings of the 16th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 881--888. ACM, 2010.

Digital Library

[20]

N. Lao and W. W. Cohen. Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81:53--67, 2010.

Digital Library

[21]

T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Infomation Retrieval, 3:225--331, 2009.

Digital Library

[22]

J. Park and S.-g. Lee. Keyword search in relational databases. Knowledge and Information Systems, 26:175--193, 2011.

Digital Library

[23]

S. Rendle. Context-Aware Ranking with Factorization Models, volume 330 of Studies in Computational Intelligence. Springer, 2010.

[24]

J. F. Sequeda, M. Arenas, and D. Miranker. On directly mapping relational databases to rdf and owl (extended version). Technical Report TR-11-28, 2011.

[25]

Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu. Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proceedings of the VLDB Endowment, 4(7), 2011.

Digital Library

[26]

Y. Tian, R. Hankins, and J. Patel. Efficient aggregation for graph summarization. In SIGMOD '08: Proceedings of the 34th ACM SIGMOD Int'l Conf. on Management of Data, pages 567--580. ACM, 2008.

Digital Library

[27]

T. Tran, H. Wang, S. Rudolph, and P. Cimiano. Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. In ICDE '09: Proceedings of the 25th IEEE Int'l Conf. on Data Engineering, pages 405--416. IEEE, 2009.

Digital Library

[28]

R. Varadarajan, V. Hristidis, and L. Raschid. Explaining and reformulating authority flow queries. In ICDE '08: Proceedings of the 24th IEEE Int'l Conf. on Data Engineering, pages 883--892. IEEE, 2008.

Digital Library

[29]

R. Varadarajan, V. Hristidis, L. Raschid, M.-E. Vidal, L. Ibáñez, and H. Rodríguez-Drumond. Flexible and efficient querying and ranking on hyperlinked data sources. In EDBT '09: Proceedings of the 12th Int'l Conf. on Extending Database Technology: Advances in Database Technology, pages 553--564. ACM, 2009.

Digital Library

[30]

C. Yu, L. Lakshmanan, and S. Amer-Yahia. Recommendation diversification using explanations. In ICDE '09: Proceedings of the 25th IEEE Int'l Conf. on Data Engineering, pages 1299--1302. IEEE, 2009.

Digital Library

Cited By

Nica ASuchanek FVarde A(2015)New Research Directions in Knowledge Discovery and Allied SpheresACM SIGKDD Explorations Newsletter10.1145/2783702.278370816:2(46-49)Online publication date: 21-May-2015
https://dl.acm.org/doi/10.1145/2783702.2783708
Pienta RAbello JKahng MChau D(2015)Scalable graph exploration and visualization: Sensemaking challenges and opportunities2015 International Conference on Big Data and Smart Computing (BIGCOMP)10.1109/35021BIGCOMP.2015.7072812(271-278)Online publication date: Feb-2015
https://doi.org/10.1109/35021BIGCOMP.2015.7072812
Lee SKahng MLee S(2015)Constructing compact and effective graphs for recommender systems via node and edge aggregationsExpert Systems with Applications: An International Journal10.1016/j.eswa.2014.11.06242:7(3396-3409)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.eswa.2014.11.062
Show More Cited By

Index Terms

Ranking objects by following paths in entity-relationship graphs
1. Information systems
  1. Information retrieval
    1. Retrieval models and ranking
    2. Retrieval tasks and goals
      1. Document filtering
      2. Information extraction
  2. Information systems applications

Recommendations

Equimatchable Graphs on Surfaces

A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Finding multiple induced disjoint paths in general graphs

In an undirected graph, paths P"1,P"2,...,P"k are induced disjoint if each one of them is chordless (i.e., is an induced path) and any two of them have neither common nodes nor adjacent nodes. This paper investigates the Maximum Induced Disjoint Paths (...
Applying collaborative filtering techniques to movie search for better ranking and browsing
KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining

We propose a new ranking method, which combines recommender systems with information search tools for better search and browsing. Our method uses a collaborative filtering algorithm to generate personal item authorities for each user and combines them ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PIKM '11: Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management

October 2011

100 pages

ISBN:9781450309530

DOI:10.1145/2065003

Program Chairs:
Anisoara Nica
Sybase, An SAP Company, Canada
,
Fabian M. Suchanek
INRIA, France

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CIKM '11

Sponsor:

CIKM '11: International Conference on Information and Knowledge Management

October 28, 2011

Glasgow, Scotland, UK

Acceptance Rates

Overall Acceptance Rate 25 of 62 submissions, 40%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
205
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nica ASuchanek FVarde A(2015)New Research Directions in Knowledge Discovery and Allied SpheresACM SIGKDD Explorations Newsletter10.1145/2783702.278370816:2(46-49)Online publication date: 21-May-2015
https://dl.acm.org/doi/10.1145/2783702.2783708
Pienta RAbello JKahng MChau D(2015)Scalable graph exploration and visualization: Sensemaking challenges and opportunities2015 International Conference on Big Data and Smart Computing (BIGCOMP)10.1109/35021BIGCOMP.2015.7072812(271-278)Online publication date: Feb-2015
https://doi.org/10.1109/35021BIGCOMP.2015.7072812
Lee SKahng MLee S(2015)Constructing compact and effective graphs for recommender systems via node and edge aggregationsExpert Systems with Applications: An International Journal10.1016/j.eswa.2014.11.06242:7(3396-3409)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.eswa.2014.11.062
Castro HAndrade MAlmeida FTropea GMelazzi NMousas AKaklamani DChiariglione LDifino A(2015)Semantically connected web resources with MPEG-21Multimedia Tools and Applications10.1007/s11042-014-1918-174:2(439-462)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s11042-014-1918-1
Kahng MLee SHersh WCallan JMaarek YSanderson M(2012)Exploiting paths for entity search in RDF graphsProceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval10.1145/2348283.2348452(1027-1028)Online publication date: 12-Aug-2012
https://dl.acm.org/doi/10.1145/2348283.2348452
Lee SMille AGandon FMisselis JRabinovich MStaab S(2012)A generic graph-based multidimensional recommendation framework and its implementationsProceedings of the 21st International Conference on World Wide Web10.1145/2187980.2188002(161-166)Online publication date: 16-Apr-2012
https://dl.acm.org/doi/10.1145/2187980.2188002
Nica ASuchanek F(2011)PIKM 2011Proceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2064049(2633-2634)Online publication date: 24-Oct-2011
https://dl.acm.org/doi/10.1145/2063576.2064049

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten