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

Commodity correlation big data sparse network quick clustering method

A clustering method and big data technology, applied in the field of big data processing, can solve problems such as inapplicable big data association analysis of retail goods, achieve flexible memory dynamic management, eliminate redundant space, and improve mining efficiency

Active Publication Date: 2017-02-22
DALIAN MARITIME UNIVERSITY
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The currently widely used adjacency matrix and adjacency linked list storage methods are used to analyze and mine potential laws and require multiple access to data, so they are not suitable for big data association analysis of retail products.
However, the clustering of large data sparse network oriented to retail goods needs to focus on improving efficiency. Commonly used complex network clustering needs to give an effective objective function and optimal solution search strategy in advance, and the search process sacrifices efficiency to improve the accuracy of clustering. , which is not suitable for clustering retail commodity association big data sparse networks

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
  • Commodity correlation big data sparse network quick clustering method
  • Commodity correlation big data sparse network quick clustering method
  • Commodity correlation big data sparse network quick clustering method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0050] Referring to the accompanying drawings, the method for fast clustering of commodity-associated big data sparse networks proposed by the present invention will be described in detail below.

[0051] Such as figure 1 As shown, the present invention comprises three stages of clustering: (1) utilize the single-step linked list structure to store the common purchase relationship matrix of retail goods; (2) pruning the low-degree commodity nodes of the commodity association big data sparse network; ( 3) Using the idea that high-value commodity nodes are divided by low-value commodity nodes to quickly cluster commodity-associated big data sparse networks.

[0052] The implementation process of the present invention will be described below with specific examples. Assuming that there are 8 types of products, the sales records are as follows:

[0053] Sales records for 8 items

[0054]

[0055] Note: "√" in the table indicates that the product has been purchased.

[0056]...

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 discloses a commodity correlation big data sparse network quick clustering method which comprises the steps of performing preprocessing on commodity sale recording data, establishing and storing a commodity correlation big data sparse network; performing pruning on the commodity correlation big data sparse network; and performing quick clustering on the commodity correlation big data sparse network, thereby obtaining a clustering result. According to the method of the invention, a single-step linked list structure is utilized for storing a relation between commodity nodes, and only relations of the commodity nodes which are directly connected with the commodity nodes are marked, and a redundant space in a common purchasing relation matrix is eliminated. According to the method of the invention, pruning is performed on low-degree commodity nodes for improving digging efficiency and improving clustering precision. According to the commodity correlation big data sparse network quick clustering method, a concept of dividing high-degree commodity nodes by low-degree commodity nodes can eliminate restriction by a traditional clustering algorithm, and judgment is directly performed according to the value of the degree. A clustering process can be finished without consideration for data distribution, no multiple times of data accessing or prior knowledge.

Description

technical field [0001] The invention belongs to big data processing technology, in particular to a sparse network processing method for commodity-associated big data. Background technique [0002] With the comprehensive application of information systems and information construction, retail enterprises generate a large number of data records in operation management, and mining the business perspective and market rules among these data has considerable application value. By studying the shopping transaction data of retail enterprises and mining the correlations and frequent item sets among commodities, retail enterprises can be guided to make more scientific and reasonable operational decisions such as category management, store layout display, and product promotion, and greatly improve the enterprise's profitability. Operating results. With the rapid development of e-commerce, Amazon, JD.com, Yihaodian and other e-commerce retail enterprises provide marketing services such ...

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): G06K9/62G06Q30/02G06F17/30
CPCG06F16/2457G06Q30/0201G06F2216/03G06F18/232
Inventor 李桃迎陈燕张金松孙爽张春刚
Owner DALIAN MARITIME UNIVERSITY
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