Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

BHR-Tree-index-based ride-sharing group discovery method

A discovery method and indexing technology, applied in database indexing, structured data retrieval, digital data information retrieval, etc., can solve the problems of low accuracy and efficiency, achieve the advantages of reducing space usage, efficiency and accuracy, and speed up retrieval Effect

Inactive Publication Date: 2019-09-13
CHANGAN UNIV
View PDF4 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the problem of low accuracy and efficiency of existing ride-sharing group discovery and matching, the purpose of the present invention is to propose a method for discovering ride-sharing groups based on BHR-Tree index

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • BHR-Tree-index-based ride-sharing group discovery method
  • BHR-Tree-index-based ride-sharing group discovery method
  • BHR-Tree-index-based ride-sharing group discovery method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043] The group discovery method based on the BHR-Tree (microgroup-oriented historical R-tree) index proposed by the present invention will be specifically described below in conjunction with the accompanying drawings.

[0044] The present invention comprises the following steps:

[0045] Step 1: Preprocess the collected GPS data, extract the longitude, latitude, and time user identification information, and eliminate the abnormal data such as duplication and data with latitude and longitude out of bounds to obtain the preprocessed trajectory data. Since there is a lot of redundant information in the preprocessed trajectory data, the method of cluster identification of stay points is adopted (Zheng Y, Zhang L, Ma Z, et al. Recommending friends and locations based on individual location history [J]. ACM Transactions on the Web, 2011, 5(1):1-44.) compresses the preprocessed trajectory data to form a stay point trajectory. At the same time, in order to facilitate the effective ma...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a BHR-Tree-index-based ride-sharing group discovery method, comprising the following steps: preprocessing acquired GPS data to form a stay point track; for the stay point track, defining a Buddy which represents a partner, and establishing an index for the Buddy; establishing a secondary index for the Buddy under each time slot; and on the basis of establishing the secondary index, finding similar travelers through position retrieval. According to the BHR-Tree-index-based ride-sharing group discovery method, through a two-layer index structure, retrieval of traveler tracks can be accelerated, and rapid maintenance and updating can be carried out on the established Buddy index while improvement on a leaf node updating mechanism of HR-Tree is carried out, so that thespace utilization rate of the HR-Tree can be reduced; and finally, the travelers for sharing ride can be quickly found out through space-time query. The BHR-Tree-index-based ride-sharing group discovery method has greater advantages in the aspects of group discovery efficiency and accuracy.

Description

technical field [0001] The present invention relates to a research on a group discovery method in ride-sharing travel, in particular to a method for discovering a ride-sharing group based on a BHR-Tree index. Background technique [0002] With the continuous acceleration of my country's urbanization process, the urban population has grown rapidly, and the resulting urban car ownership has continued to increase, which has brought enormous pressure to urban traffic. As an emerging sustainable transportation mode, shared travel can effectively alleviate the congestion problem in urban road traffic. The rapid discovery of ride-sharing groups can effectively improve the travel experience and the quality of ride-sharing services, and promote the development of ride-sharing travel. The generation of large-scale traffic data provides data support for the discovery of ride-sharing groups based on GPS trajectories. [0003] The main problem of group discovery in ride-sharing researc...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/22G06F16/2458G06F16/248G06F16/29G06Q50/30
CPCG06F16/2246G06F16/2477G06F16/248G06F16/29G06Q50/40
Inventor 唐蕾龚学辉段宗涛
Owner CHANGAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com