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

A community search method in a k-kernel based social network

A technology of social network and search method, applied in the field of graph index of maximum spanning tree, which can solve the problem of high time complexity

Inactive Publication Date: 2018-07-10
SHENZHEN UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] Although global search and local search have good time complexity, for a given query node, these two algorithms need to execute a complete algorithm for each query, and the time complexity is still high

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
  • A community search method in a k-kernel based social network
  • A community search method in a k-kernel based social network
  • A community search method in a k-kernel based social network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] Specific embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0036] Before carrying out the description of the present invention, the problem to be solved by the present invention is defined earlier, as figure 1 As shown, given an undirected connected graph G=(V,E), and a query point set Q, it is required to find a k-core of G, so that it contains all the nodes in the point set Q, and also satisfies The k value is the largest. that is figure 1 In the graph G shown, find the k-core connecting two black nodes and its k value is the largest.

[0037] In order to solve the above problems, a community search method in social networks based on k-kernel is provided, such as figure 1 As shown, first, calculate the kernel value of all nodes in the input graph G; then, assign the smaller value of the kernel value of the endpoint as the weight of each edge; then, generate the maximum spanning tree MST for the w...

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

A community search algorithm based on a k-kernel comprises: generating a maximum spanning tree (MST) for a map; preprocessing the maximum spanning tree (MST); finding a subtree connected to all query nodes from the maximum spanning tree (MST); and searching to obtain a subtree comprising the query nodes, and returning a maximum K-kernel. By means of the algorithm, the k-kernel comprising a designated node can be found in the time complexity O(T), the value of k is the maximum, and T is the size of a community to be searched for.

Description

technical field [0001] The invention relates to a maximum spanning tree graph index technology, in particular to a community search method in a k-kernel-based social network. Background technique [0002] In recent years, community mining in graphs and social networks has attracted widespread attention, which is also one of the more fundamental problems in graph mining. Most research works only focus on finding out the community structure in the original image. However, in many application scenarios it is of interest to find the communities formed by a given set of nodes. [0003] The community search problem based on a given node is defined as: Given an undirected connected graph G and a point set Q in the graph, find a k-core of G so that it contains all nodes in the given node set Q and Its k value is the largest. [0004] For this problem, a simple greedy algorithm can find qualified communities in polynomial time (see reference [1] for details); global search algorit...

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 Patents(China)
IPC IPC(8): G06F17/30
CPCG06F16/00
Inventor 李荣华廖凯华毛睿蔡涛涛韦元秦璐
Owner SHENZHEN 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