Suchergebnisse - Algorithms Keywords Random graphs

The Cut Metric, Random Graphs, and Branching Processes von Bollobás, Béla, Janson, Svante, Riordan, Oliver

“… random graph model introduced by the present authors in Random Struct. Algorithms 31:3–122 ( 2007 ), as well as related results …”
Volltext

Finding One Community in a Sparse Graph von Montanari, Andrea

“… We consider a random sparse graph with bounded average degree, in which a subset of vertices has higher connectivity than the background …”
Volltext

Finding Hamilton cycles in random intersection graphs von Rybarczyk, Katarzyna

“… To this end we analyse a classical algorithm for finding Hamilton cycles in random graphs (algorithm HAM) and study its efficiency on graphs from a family of random intersection graphs …”
Volltext

VCGERG: Vulnerability Classification With Graph Embedding Algorithm on Vulnerability Report Graphs von Liu, Yashu, Zhao, Xiaoyi, Qiu, Xiaohua, Yan, Han-Bing

“… We propose a new model, VCGERG, which products a graph using key information from vulnerability reports and embeds the graph into the vector space using a keywords-LINE graph embedding algorithm …”
Volltext

SOOP: Efficient Distributed Graph Computation Supporting Second-Order Random Walks von Niu, Songjie, Zhou, Dongyan

“… The second-order random walk has recently been shown to effectively improve the accuracy in graph analysis tasks …”
Volltext

UNSUPERVISED KEYWORD EXTRACTION FROM MICROBLOG POSTS VIA HASHTAGSa von Li, Lin, LIU, JINHANG, Sun, Yueqing, XU, GUANDONG, Yuan, Jingling, LUO ZHONG

“… Keyword extraction from such texts like microblog posts benets many applica- tions such as advertising, search, and content ltering …”
Volltext

Reliable Keyword Query Interpretation on Summary Graphs von Zhong, Ming, Zheng, Yingyi, Xue, Guotong, Liu, Mengchi

“… The semantic gap between keyword queries and search intents behind them motivates intensive studies on keyword query interpretation, which aims to interpret a keyword query to structured queries (a.k.a. patterns …”
Volltext

Keyword Search over Distributed Graphs with Compressed Signature von Ye Yuan, Xiang Lian, Lei Chen, Yu, Jeffery Xu, Guoren Wang, Yongjiao Sun

“… , a Web-scale graph containing billions of vertices. The state-of-the-art approaches employ centralized algorithms to process graph keyword searches, and thus …”
Volltext

Application of Conditional Random Field Model Based on Machine Learning in Online and Offline Integrated Educational Resource Recommendation von Zeng, Erqi

“… To improve the accuracy of educational resource recommendation, this paper proposes an educational resource recommendation system based on a graph attention network and conditional random field fusion model …”
Volltext

Privacy-Preserving Hierarchical Top-k Nearest Keyword Search on Graphs von Zhu, Xijuan, Xu, Zifeng, Hu, Chao, Lin, Jun

“… A key task is the top-k nearest keyword (kNK) search on undirected graphs where a query vertex and keywords identify k closest vertices containing the keyword …”
Volltext

Large very dense subgraphs in a stream of edges von Mathieu, Claire, de Rougemont, Michel

“… We show that if the graph contains a very dense subgraph of size $\Omega(\sqrt{n})$ , then the detection algorithm is almost surely correct …”
Volltext

NERank+: a graph-based approach for entity ranking in document collections von Wang, Chengyu, Zhou, Guomin, He, Xiaofeng, Zhou, Aoying

“… A meta-path constrained random walk algorithm is proposed to propagate prior entity and topic ranks based on the graph model.We evaluate NERank+ over real-life datasets and compare it with baselines. Experimental results illustrate the effectiveness of our approach …”
Volltext

Privacy-Preserving Approximate Top-k Nearest Keyword Queries over Encrypted Graphs von Shen, Meng, Wang, Minghui, Xu, Ke, Zhu, Liehuang

“… With the prosperity of graph-based applications, it is increasingly popular for graph nodes to have labels in terms of a set of keyword …”
Volltext

Faster MCMC for Gaussian latent position network models von Spencer, Neil A., Junker, Brian W., Sweet, Tracy M.

“… Latent position network models are a versatile tool in network science; applications include clustering entities, controlling for causal confounders, and defining priors over unobserved graphs …”
Volltext

Integrating data and knowledge to identify functional modules of genes: a multilayer approach von Liang, Lifan, Chen, Vicky, Zhu, Kunju, Fan, Xiaonan, Lu, Xinghua, Lu, Songjian

“… Results Our new model and algorithm were applied to both yeast and human interactomes. Predicted functional modules have covered over 90 …”
Volltext

Path Planning Under Kinematic Constraints by Rapidly Exploring Manifolds von Jaillet, L., Porta, J. M.

“… This paper presents the AtlasRRT algorithm, which is a planner especially tailored for such constrained systems that builds on recently developed tools for higher-dimensional continuation …”
Volltext

Finding story chains in newswire articles using random walks von Zhu, Xianshu, Oates, Tim

“… Traditional keyword-based search engines provide limited support for finding story chains. In this paper, we propose a random walk based algorithm to find story chains …”
Volltext

Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator von Sheikholeslami, S. M., Anoos, R., Kosari, S., Shao, Zehui, Dayap, J. A.

“… The proposed encryption utilizes the properties of outer-convex dominating set in the corona of graphs to generate random keys from the shared keyword to every character of the message …”
Volltext

Research of Hierarchical Random Graph Model based on maximum likelihood estimation von Shaoyan, Sun, Fengnan, Sun

“… According to the features of the complex network's structure, the Hierarchical Random Graph Model (HRGM …”
Volltext

Multi-label Moves for MRFs with Truncated Convex Priors von Veksler, Olga

“… ) for a pixel p to either keep its old label or switch to a new label. Two move-making algorithms based on graph cuts are in wide use, namely the swap and expansion …”
Volltext