Skip to main content

OSim: An OLAP-Based Similarity Search Service Solver for Dynamic Information Networks

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9798))

  • 1552 Accesses

Abstract

Similarity search service has always been one of the most popular topics in data mining. In recent years similarity search has been embedded in a more comprehensive framework and the semantic meanings behind meta paths play a crucial role in measuring similarity in heterogeneous information networks. PathSim has been considered one of the state-of-art models to find peer objects in the network. However, it only conducts similarity search in a global setting and the object attributes are not taken into consideration. In this paper, we propose OSim, a novel OLAP-based similarity search service solver. OSim is an attribute-enriched meta path-based measure to capture similarity based on object connectivity, visibility and features. A set of common attribute dimensions are defined across different types of objects and each dimension forms a hierarchical attribute tree. A path on the tree is represented by a node vector, pointing from the highest to a lowest level node. An object therefore can be described by a set of such node vectors. Online Analytical Processing techniques are further utilized in this framework to provide analysis in multiple resolutions and to improve search efficiency. Experiments show that our approaches improve search efficiency without compromising effectiveness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tao, F., Han, J., Ji, H., Brova, G., Wang, C., Kishky, A., Liu, J.: NewsNetExplorer: automatic construction and exploration of news information networks. In: Proceedings of SigMOD, pp. 1091–1094 (2014)

    Google Scholar 

  2. Zhang, D., Zhai, C., Han, J., Srivastava, A., Oza, N.: Topic modeling: for OLAP on multidimensional text databases: topic cube and its applications. Stat. Anal. Data Min. 2(5), 378–395 (2009)

    Article  MathSciNet  Google Scholar 

  3. Jeh, G., Widom, J.: SimRank: a measure of structural context similarity. In: Proceedings of KDD, pp. 538–543 (2002)

    Google Scholar 

  4. Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of WWW, pp. 271–279 (2003)

    Google Scholar 

  5. Lin, C., Ding, B., Han, J., Zhu, F., Zhao, B.: Text cube: computing IR measures for multidimensional text database analysis. In: Proceedings of ICDM, pp. 905–910 (2008)

    Google Scholar 

  6. Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and OLAP multidimensional networks. In: Proceedings of ACM SigMOD, pp. 853–864 (2011)

    Google Scholar 

  7. Sun, Y., Han, J., Yan, X., Yu, P., Wu, T.: PathSim: meta path-based Top-K similarity search in heterogeneous information networks. In: Proceedings of VLDB, pp. 992–1003 (2011)

    Google Scholar 

  8. Tian, Y., Hankins, R., Patel, J.: Efficient aggregation for graph summarization. In: Proceedings of SigMOD, pp. 567–580 (2008)

    Google Scholar 

  9. Zhang, N., Tian, Y., Patel, J.: Discovery-driven graph summarization. In: Proceedings of ICDE, pp. 880–891 (2010)

    Google Scholar 

  10. Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.: Graph OLAP: towards online analytical processing on graphs. In: Proceedings of ICDM, pp. 103–112 (2008)

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by the Program for Changjiang Scholars and Innovative Research Team in University (Grant No. IRT1278), the National Natural Science Foundation of China NSFC (Grant No. 41127901-06, 61572370), Development Program of China “863 Project” (Grant No. 2015AA016004), the Natural Science Foundation of Hubei Province of China (Grant No. 2014CFB191).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoguang Niu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Niu, X., Zhang, Y., Huang, T., Wu, X. (2016). OSim: An OLAP-Based Similarity Search Service Solver for Dynamic Information Networks. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42836-9_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42835-2

  • Online ISBN: 978-3-319-42836-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics