Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Traffic flow sequence classification method based on density peak value clustering

A technology of peak density and traffic flow, applied in the field of traffic control research, it can solve the problems such as similarity in flow change laws, large computational time complexity, and inability to automatically optimize the number of clusters.

Active Publication Date: 2017-02-15
ZHEJIANG UNIV
View PDF3 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, the traditional clustering method is mostly used in the time division of signal control, that is, the flow values ​​of all time periods in a day are regarded as samples, and according to the attributes of the samples themselves, mathematical methods are used to quantify the data according to certain similarity or difference indicators There are three problems in determining the closeness relationship between samples and clustering the samples according to the degree of closeness relationship: 1. Most methods cannot automatically optimize the reasonable number of clusters, and need to compare the experimental data multiple times to get the best results ; 2. Most of the methods with automatic output of cluster numbers and results are enumerated, and the calculation time complexity is relatively large; 3. All methods are limited to determining the time division scheme for the traffic data of a specific day, without considering There are also similarities in the flow change law between different days, and the same period division scheme can be used for several days with similar change rules

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
  • Traffic flow sequence classification method based on density peak value clustering
  • Traffic flow sequence classification method based on density peak value clustering
  • Traffic flow sequence classification method based on density peak value clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] Taking the 24-day traffic sequence of an intersection in a city as an example, classify the 24-day data. For the specific implementation process, see figure 1 .

[0057] 1. Divide the total flow sequence into 24 subsequences in units of days, and calculate the local density of each subsequence:

[0058] (1) In the 24 subsequences, calculate the similarity between every two subsequences, record 24 subsequences as X=x 1 ,x 2 ,...x n ;

[0059] (2) For any subsequence i, the subsequence is divided into several segments at intervals of fixed periods, and the segment sequence is x i =x i (1), x i (2),...,x i (N); usually the fixed period is 5 minutes, 10 minutes or 15 minutes.

[0060] ①Calculate the corresponding Euclidean distance d between subsequences i and j ij :

[0061]

[0062] ②Calculate the average of all subsequence distances:

[0063]

[0064] ③ Calculate the variance of the Euclidean distance between subsequence i and other subsequences:

[006...

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 provides a traffic flow sequence classification method based on density peak value clustering. The traffic flow sequence classification method utilizes distance variance for measuring similarity degrees of subsequences, and comprises the steps of: calculating local density of each subsequence, measuring mutual cluster degrees between sequences, and searching for a clustering center by combining the local density with sequence spacing, wherein the sequence spacing is used for measuring class separability; and classifying sequences of non-clustering center by utilizing a density value, so as to obtain reasonable groups of the traffic flow sequences, and finally output a clustering result. According to the traffic flow sequence classification method, the subsequences of the same class can adopt the same time period dividing scheme and signal control scheme, and the workload of time period division and signal optimization under a timed control strategy is reduced on the premise of guaranteeing operation efficiency of the traffic flow.

Description

technical field [0001] The invention relates to a method for dividing traffic flow sequences, in particular to a method for dividing traffic flow sequences based on density peak clustering, and belongs to the field of traffic control research. Background technique [0002] Most of the existing signal control systems have self-adaptive functions, which mainly rely on the detection information of the coil detection equipment to optimize the signal control scheme in real time. However, in practical applications, coil detectors have a high incidence of damage and failure, and other types of detector data, including video, microwave, and geomagnetism, are difficult to directly access to existing signal control systems, resulting in many signal control systems And signal controllers can only passively adopt a fixed timing scheme. In order to improve the traffic flow operation efficiency of the intersection as much as possible, the signal timing scheme under the timing control str...

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): G08G1/01G06K9/62
CPCG08G1/0125G06F18/232G06F18/24147
Inventor 马东方李文婧罗小芹叶彬金盛王殿海王福建瞿逢重徐敬孙贵青吴叶舟
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products