10 results about "Community search" patented technology

According to the privacy enhancement type (k, d)-truss community search method for the social network, a novel KTG tree structure is constructed by fusing k-truss and G-tree indexes. According to the index structure, hierarchical community decomposition of a social graph and social distance information are fused, a refined boundary vector coding scheme is designed to support efficient distance calculation, and a double-cloud-server non-collusion architecture integrating improved homomorphic encryption and matrix encryption technologies is constructed. Through a two-stage security query process of first structure filtering and then distance verification, on the premise of protecting full-process privacy of a graph structure, a query intention, a distance matrix and an intermediate calculation result, efficient and accurate search of a close community in a large-scale social network is realized. The method is suitable for various scenes such as social recommendation, risk control, public opinion analysis and anti-fraud, and the problems of privacy disclosure and calculation efficiency in social network analysis are effectively solved.

This invention provides a privacy-preserving community search method and system for graph data streams. It utilizes a secret shared domain comprised of multiple servers. Within this domain, each server can only access the first encrypted data of the graph data stream's list structure and the second encrypted data of the search parameters. Throughout the community search process, the search parameters and all information in the graph data stream except for the time of generation are processed within the encrypted domain and are not leaked to the querying server, thus achieving privacy protection during the community search process for graph data streams.

This invention belongs to the field of computer science, specifically relating to a community search method for product recommendation in an e-commerce network. The method includes: converting the e-commerce network into an undirected attribute graph G; initializing parameters and calculating the attribute-enhancing conductance of each node in the undirected attribute graph based on the initialization parameters; extracting candidate coarse communities based on the attribute-enhancing conductance; selecting coarse communities from the candidate coarse communities; processing the coarse communities using a trained neural community optimization model to obtain an encoding state; optimizing the coarse communities based on the encoding state to obtain refined communities; and recommending products based on online community search results. This invention combines deep learning technology with traditional predefined structural constraints. This method organically combines the advantages of both, thereby significantly improving the quality of community search.

The invention discloses a distributed graph community search method based on odd-even overstep synchronous control, and belongs to the field of distributed computing, and the search method comprises the following specific steps: I, taking a corresponding query vertex as a starting point, carrying out initialization, and sending connectivity messages to all neighbor vertexes after the initialization is completed; iI, on the basis of the corresponding connectivity message, each neighbor vertex updates the own state, checks the corresponding degree after updating is completed, and updates the state of the corresponding vertex according to the check result; according to the method, invalid activation can be remarkably reduced, local optimal and invalid expansion is avoided, the number of messages is greatly reduced, and communication and calculation burdens are reduced; meanwhile, the search range can be narrowed, repeated calculation in an invalid area is avoided, the calculation efficiency and the resource utilization rate are improved, and the method is adaptive to a super-large-scale distributed environment.

The application relates to a comment display method and device based on Internet community comment likes, which comprises the following steps: when receiving a like operation of a user on any comment in an Internet community, searching for and identifying a keyword in the comment; when the keyword is identified in the comment, determining whether the keyword is in a search flow keyword blacklist; when the keyword is not in the search flow keyword blacklist, determining whether the number of posts in an Internet community search result corresponding to the keyword is greater than or equal to a preset threshold; when the number of posts is greater than or equal to the preset threshold, obtaining an Internet community search result page URL corresponding to the keyword, and associating the Internet community search result page URL with the keyword; and highlighting the keyword in the comment. Through the technical scheme, small and special interest topics in a community can find users who are really interested in the topics, and the content transmission efficiency of the community platform is improved.

A cross-dataset universal community search method, belonging to the field of graph data mining and information retrieval technology, comprises the following steps: Step 1: Constructing the required sample set and training graph; Step 2: Using spectral awareness for feature alignment to form spectral awareness aligned training features; Step 3: Constructing hybrid token sequences for nodes in the training graph; Step 4: Encoding the token sequences using a Transformer encoder to obtain a unified community-aware representation; Step 5: Reconstructing the representation using a diffusion model; Step 6: Training the model; Step 7: Inputting the target dataset into the model obtained in Step 6 for community search to obtain the results. This invention, through the above method, allows the target dataset to be directly input into the model for inference and community search during the application stage, without the need for retraining or fine-tuning, thereby improving the efficiency and search quality of cross-dataset deployment.

The invention provides an unsupervised heterogeneous community search method, program and system based on behavior modeling and a storage medium. The system comprises a data acquisition device, a model training device and a community searching device. According to the method CLHComS, a framework of type perception feature mapping and double-view contrast learning is adopted, firstly, node local relation features are captured through a relation perception GNN module, then high-order semantic association is mined through a metapath Transform module, unsupervised training is completed in combination with a loss function in a view and a loss function between views, and node embedding capable of describing heterogeneous network symbol features is generated. According to the CLHComS method, community retrieval can be efficiently completed on the heterogeneous symbol network, and target communities which contain query nodes and are dense in forward interaction are automatically mined through an iteration expansion criterion of single-type expectation scoring gains. The method can be deployed at the rear end of each server room, and can be widely applied to the application fields of community search and the like under heterogeneous graph scenes such as social networks and the like.

The application provides a community search method, device, medium and equipment, the method comprises the following steps: according to complex network data set, the multiple graph model of dynamic attribute network is constructed, input specified parameter l, k and θ, wherein l represents sequence length threshold value, k represents support threshold value, and θ represents search score threshold value;The range of the edge time stamp in the network is determined to determine the time span, and the multiple graph model is divided into different time snapshots;In each time snapshot, the number of triangles formed by each edge in the current time snapshot is calculated as the support of the edge, and each dynamic edge is traversed, and the dynamic edge whose support is less than k or does not meet the existence in the continuous time snapshot of length l is deleted in a loop;Based on the search score threshold value θ, the remaining nodes of all time snapshots are integrated, and the (l, k, θ)‑truss structure model is obtained, and the induced subgraph of the (l, k, θ)‑truss structure model in the original multiple graph model G is taken as the result community.

The application provides a community searching method and device based on maximum clique search on uncertain graph, and relates to the field of data processing.The method comprises the following steps: obtaining an initial graph corresponding to a social network to be processed; determining reference values of each vertex in the initial graph; deleting vertices with reference values not greater than heuristic solution values in the initial graph to obtain a vertex set corresponding to the heuristic solution values, and determining an intermediate subgraph based on the vertex set; performing multiple search operations on each vertex in the intermediate subgraph, determining a target subgraph with the largest number of vertices based on candidate subgraphs obtained through the search operations, and ensuring that there is an edge between any two different vertices in the target subgraph and the product of the existence probabilities of all edges is greater than a preset probability value; and determining a target social user community in the social network to be processed based on the target subgraph.The application can search for a social user community based on uncertain correlation data between social users.