Precomputing Hybrid Index Architecture for Flexible Community Search over Location-Based Social Networks
File version
Accepted Manuscript (AM)
Author(s)
Wang, J
Awrangjeb, M
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Dalian, China
License
Abstract
Community search is defined as finding query-based communities within simple graphs. One of the most crucial community models is minimum degree subgraph in which each vertex has at least k neighbours. Due to the rapid development of location-based devices; however, simple graphs are unable to handle Location-Based Social Networks LBSN personal information such as interests and spatial locations. Hence, this paper aims to construct a Precomputed Hybrid Index Architecture (PHIA) for the sake of enhancing simple graphs to store and retrieve information of LBSN users. This method consists of two stages; the first is precomputing, and the second is index construction. Numerical testing showed that our hybrid index approach is reasonable because of its flexibility to combine different dimensions by adapting the wide used community model
Journal Title
Conference Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Book Title
Edition
Volume
11888
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© Springer Nature Switzerland AG 2019. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
Item Access Status
Note
Access the data
Related item(s)
Subject
Artificial intelligence
Persistent link to this record
Citation
Alaqta, I; Wang, J; Awrangjeb, M, Precomputing Hybrid Index Architecture for Flexible Community Search over Location-Based Social Networks, Lecture Notes in Computer Science, 2019, 11888, pp. 277-287