Skip to main content
SpringerLink
Log in

K-truss community most favorites query based on top-t

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Top-t queries, which return t results with the highest scores according to the user’s preferences, have been extensively studied. However, many studies often fail to take into account the social relationships among users, and close social relationships usually guarantee the consistency of users’ preferences. Many real-world applications, such as community-based product recommendation services, require such queries. In this paper, we propose a new problem: the k-truss community most favorites querying problem based on user top-t favorites. Specifically, both the k-truss community and the corresponding most favorite object are retrieved. We first present the baseline solution to the problem. The main idea is to find the same object in the top-t favorites of the users in the social network and build the k-truss community for these users with the same preferences. Furthermore, we propose a reverse query algorithm to speed up the processing of the k − t CMF querying problem by filtering users in the social network. The experiment results on both real and synthetic datasets significantly demonstrate that the proposed solutions are efficient and scalable.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. http://www.yelp.com

  2. snap.stanford.edu

References

  1. Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. In: International Conference on Very Large Data Bases (2017)

  2. Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: International Conference on Data Engineering (2002)

  3. Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Natl. Secur. Agency Tech. Rep 16(3) (2008)

  4. Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, June 22-27, 2014, pp. 991–1002. ACM (2014)

  5. Edachery, J., Sen, A., Brandenburg, F.J.: Graph clustering using distance-k cliques (1999)

  6. Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. Vldb Journal 29(1), 353–392 (2020)

    Article  Google Scholar 

  7. Guo, F., Yuan, Y., Wang, G., Chen, L., Wang, Z.: Cohesive group nearest neighbor queries over road-social networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE) (2019)

  8. Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Sigmod (2014)

  9. Huang, X., Lakshmanan, L.V.S.: Attribute truss community search (2016)

  10. Huang, X., Lakshmanan, L.V.S., Xu, J.: Community search over big graphs. In: Community Search over Big Graphs (2019)

  11. Huang, X., Lakshmanan, L.V.S., Yu, J.X., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endow. 9(4), 276–287 (2015)

    Article  Google Scholar 

  12. Ihab, F., Ilyas, G., Beskales, M., Soliman, A.: A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (2008)

  13. Jia-Ling, K., Chen-Yi, L., Arbee, L., Chen, P.: Finding k most favorite products based on reverse top-t queries. Vldb Journal the International Journal of Very Large Data Bases (2014)

  14. Lakshmanan, L.V.S., Lakshmanan, L.V.S.: Attribute-driven community search. VLDB Endowment (2017)

  15. Li, C., Chang, K.C.C., Ilyas, I.F., Song, S.: Ranksql: query algebra and optimization for relational top-k queries. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 131–142 (2005)

  16. Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: Dada: a data cube for dominant relationship analysis. In: ACM Sigmod International Conference on Management of Data (2006)

  17. Lin, C.Y., Koh, J.L., Chen, A.L.P.: Determining k-most demanding products with maximum expected number of total customers. IEEE Trans. Knowl. Data Eng. 25(8), 1732–1747 (2013)

    Article  Google Scholar 

  18. Miah, M., Das, G., Hristidis, V., Mannila, H.: Standing out in a crowd: selecting attributes for maximum visibility. In: 2008 IEEE 24th International Conference on Data Engineering (2008)

  19. Molnar, B.: Efficient and effective community search. Computing Reviews 57(4), 252–252 (2016)

    Google Scholar 

  20. Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2010)

  21. Vlachou, A., Doulkeridis, C., Nrvg, K., Kotidis, Y.: Identifying the most influential data objects with reverse top-k queries. Proceedings of the VLDB Endowment 3(1-2), 364–372 (2010)

    Article  Google Scholar 

  22. Wan, Q., Wong, R.C., Ilyas, I.F., Özsu, M. T., Peng, Y.: Creating competitive products. Proc. VLDB Endow. 2(1), 898–909 (2009)

    Article  Google Scholar 

  23. Wan, Q., Wong, R.C., Peng, Y.: Finding top-k profitable products. In: Abiteboul, S., Böhm, K., Koch, C., Tan, K. (eds.) Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany, pp. 1055–1066. IEEE Computer Society (2011)

  24. Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endow. 5(9), 812–823 (2012)

    Article  Google Scholar 

  25. Wong, C.W., Ozsu, M.T., Yu, P.S., Fu, W.C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. Proceedings of the VLDB Endowment 2(1), 1126–1137 (2009)

    Article  Google Scholar 

  26. Wu, T., Xin, D., Mei, Q., Han, J.: Promotion analysis in multi-dimensional space. Proceedings of the Vldb Endowment 2(1), 109–120 (2009)

    Article  Google Scholar 

  27. Xia, T., Zhang, D., Kanoulas, E., Du, Y.: On computing top-t most influential spatial sites. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005 (2005)

  28. Xin, H., Lakshmanan, L.V.S., Xu, J.: Community search over big graphs: models, algorithms, and opportunities. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE) (2017)

  29. Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Transactions on Knowledge & Data Engineering 30(5), 922–935 (2018)

    Article  Google Scholar 

  30. Zhang, C., Zhang, W., Zhang, Y., Qin, L., Lin, X.: Selecting the optimal groups: efficiently computing skyline k-cliques. In: The 28th ACM International Conference (2019)

  31. Zhang, Z., Lakshmanan, L.V.S., Tung, A.K.H.: On domination game analysis for microeconomic data mining. ACM Trans. Knowl. Discov. Data 2(4), 18:1–18:27 (2009)

    Article  Google Scholar 

  32. Zheng, Z., Ye, F., Li, R.H., Ling, G., Jin, T.: Finding weighted k-truss communities in large networks. Inform. Sci. 417, 344–360 (2017)

    Article  Google Scholar 

  33. Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. pp 649–652 (2010)

Download references

Acknowledgements

The research was supported by the National Key Research and Development Program of China (2018YFB0204302) and the NSFC (Grant Nos. 61772182, 61802032).

Author information

Authors and Affiliations

  1. College of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410003, China

    Zhibang Yang

  2. College of Information Science and Engineering, Hunan University, Changsha, Hunan, 410082, China

    Zhibang Yang, Xiaoxue Li, Xu Zhang, Wensheng Luo & Kenli Li

Authors
  1. Zhibang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoxue Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wensheng Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kenli Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoxue Li.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on Large Scale Graph Data Analytics Guest Editors: Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Z., Li, X., Zhang, X. et al. K-truss community most favorites query based on top-t. World Wide Web 25, 949–969 (2022). https://doi.org/10.1007/s11280-021-00947-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-021-00947-7

Keywords

Search

Navigation