Group discovery algorithm model based on big data mining and analysis module

An algorithm model, big data technology, applied in network data retrieval, data processing applications, other database retrieval and other directions, to achieve the effect of long-term operation, good ventilation and heat dissipation, and good heat dissipation performance

Active Publication Date: 2020-05-22
南京柏跃软件有限公司
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

For example, under the premise of knowing the number of communities, Wu and Huberman proposed a fast segmentation algorithm based on the

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
  • Group discovery algorithm model based on big data mining and analysis module
  • Group discovery algorithm model based on big data mining and analysis module
  • Group discovery algorithm model based on big data mining and analysis module

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0045] Such as figure 1 As shown, a kind of group discovery algorithm model based on big data mining described in the present invention comprises the following steps:

[0046] S1: Obtain each track data of the target and perform preprocessing;

[0047] For target A, for all records of A within the specified time range, and grouped by site, each group is sorted by time, and the grouped data is deduplicated with a fixed interval, that is, if a person is in a site for a short time (interval) appears multiple times in a row, and only the first record is kept; in addition, if the repeated data lasts longer than △t, then every △t, keep a nearby record (if equal, keep the one with the earlier time) record), and the subsequent data retention time is based on the last data retention time.

[0048] S2: Take each valid trajectory data of the target as the starting point, intercept the preprocessed trajectory data with the specified time length δ, and perform preprocessing on each inter...

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 group discovery algorithm model based on big data mining, and belongs to the technical field of big data mining. The method comprises the following steps: acquiring each pieceof trajectory data of a target, and preprocessing the trajectory data; taking each piece of effective trajectory data of the target as a midpoint, and intercepting the preprocessed data for a specified time length; recording the occurrence frequency of other people in the cut slice; preliminarily determining persons in the same row by utilizing the slices; acquiring trajectory data of a target and persons in the same row and preprocessing the trajectory data; taking each effective footprint as a starting point, and intercepting the time sequence trajectory data for a known fixed length; and calculating the occurrence frequency of all targets and persons in the same row. According to the method, people who may participate in group activities together with the targets are searched through attributes such as time, coordinates and names of people entering an area uploaded by each station and the known targets.

Description

technical field [0001] The invention relates to the field of big data mining, more specifically, a group discovery algorithm model based on big data mining. Background technique [0002] Community discovery has a long history of research and takes different forms in different disciplines. It is closely related to the ideas of graph segmentation in graph theory and computer science and hierarchical clustering in social networks. [0003] Graph segmentation is an important research problem in the field of parallel computing. Suppose there are n computing processors that can communicate (the processing area is not intended to communicate with all other processors). Based on this, a network can be built in which nodes represent processors, and edges between nodes link two nodes communicating with each other. The problem to be solved in parallel computing is to assign the same number of tasks to each node and minimize the communication between nodes, that is, to make the numbe...

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
IPC IPC(8): G06F16/9536G06F16/958G06Q50/00
CPCG06F16/9536G06F16/958G06Q50/01
Inventor 薛岭王倩徐熙豪
Owner 南京柏跃软件有限公司
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
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap