Suchergebnisse - Subgraph selection algorithm

A Self-Adaptive Subgraph Generation Algorithm for EEG Channel Selection von Zhao, Kui, Kang, Yanqing, Wu, Jinru, Shi, Enze, Zhu, Di, Zhang, Shu

“… In this paper, a self-adaptive subgraph generation algorithm for EEG channel selection (SSGE), built on the base of graph convolution network (GCN …”
Volltext

Parallel custom instruction identification for extensible processors von Xiao, Chenglong, Wang, Shanshan, Liu, Wanjun, Casseau, Emmanuel

“… Determining parts of application code as custom instruction generally requires subgraph enumeration and subgraph selection …”
Volltext

Incremental Subgraph Feature Selection for Graph Classification von Haishuai Wang, Peng Zhang, Xingquan Zhu, Tsang, Ivor Wai-Hung, Ling Chen, Chengqi Zhang, Xindong Wu

“… In this paper, we propose a primal-dual incremental subgraph feature selection algorithm (ISF) based on a max-margin graph classifier …”
Volltext

Improving high-level synthesis effectiveness through custom operator identification von Chenglong Xiao, Casseau, Emmanuel

“… It is increasingly common to see custom operators appear in various fields of circuit design. Custom operators that can be implemented in special hardware …”
Volltext

Augmentation of Densest Subgraph Finding Unsupervised Feature Selection Using Shared Nearest Neighbor Clustering von Chugh, Deepesh, Mittal, Himanshu, Saxena, Amit, Chauhan, Ritu, Yafi, Eiad, Prasad, Mukesh

“… To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature clusters …”
Volltext

Two provably consistent divide-and-conquer clustering algorithms for large networks von Mukherjee, Soumendu Sundar, Sarkar, Purnamrita, Bickel, Peter J

“… We propose two algorithms that perform clustering on several small subgraphs and finally patch the results into a single clustering …”
Weitere Angaben

Modifications of the algorithm for selection isomorphic subgraphs from graph von Pelekhata, K., Tkachenko, S.

“… In this paper considered two modifications of the algorithm for selection isomorphic subgraphs from graph …”
Volltext

High-quality topological structures selection for smart city land spatial understanding and governance von Xu, Zhiyi, Wu, Yuzhe, Li, Qing, Chen, Dingpan

“… Due to the acceleration of urbanization process in modern society, there are many metropolises throughout the world, such as New York, Tokyo, and Shanghai …”
Volltext

MR-SimLab: Scalable subgraph selection with label similarity for big data von Dhifli, Wajdi, Aridhi, Sabeur, Nguifo, Engelbert Mephu

“… •Existing feature selection algorithms are facing a scalability challenge.•We propose MR-SimLab, a MapReduce-based subgraph selection approach for big data …”
Volltext

Supervised feature selection using integration of densest subgraph finding with floating forward–backward search von Bhadra, Tapas, Bandyopadhyay, Sanghamitra

“… In this paper, a novel approach of supervised feature selection is proposed based on the principle of dense subgraph discovery …”
Volltext

A comparison of heuristic algorithms for custom instruction selection von Wang, Shanshan, Xiao, Chenglong, Liu, Wanjun, Casseau, Emmanuel

“… : subgraph enumeration and subgraph selection. In this paper, we focus on the subgraph selection problem, which has been widely recognized as a computationally difficult problem …”
Volltext

Subgraph Matching with Set Similarity in a Large Graph Database von Liang Hong, Lei Zou, Xiang Lian, Yu, Philip S.

“… In this paper, we study a subgraph matching with set similarity (SMS 2 ) query over a large graph database, which retrieves subgraphs that are structurally isomorphic …”
Volltext

Tps: A new way to find good vertex-search order for exact subgraph matching von Ma, Yixing, Xu, Baomin, Yin, Hongfeng

“… Selecting an optimal vertex-searching order can greatly improve a subgraph searching algorithm's effectiveness, yet a comprehensive theory for this selection is lacking …”
Volltext

Applying novel connectivity networks to wood turtle populations to provide comprehensive conservation management strategies for species at risk von Bouchard, Cindy, Lord, Étienne, Tessier, Nathalie, Lapointe, François-Joseph

“… BRIDES characterizes different types of shortest paths among the nodes of a subgraph and compares the shortest paths among the same nodes in a complete network …”
Volltext

Overlapping Community Detection Algorithm Based on Subgraph Structure von CHEN Xiang-tao, ZHAO Mei-jie, YANG Mei

“… Local community detection algorithms usually select seed nodes for community detection.To improve the quality of effectiveness of seed node selection,we propose …”
Volltext

Integration of dense subgraph finding with feature clustering for unsupervised feature selection von Bandyopadhyay, Sanghamitra, Bhadra, Tapas, Mitra, Pabitra, Maulik, Ujjwal

“… •Superiority over three existing methods is established for eight data sets. In this article a dense subgraph finding approach is adopted for the unsupervised feature selection problem …”
Volltext

Brain Network Classification Method with Subgraph Selection and Graph-Kernel-Based Dimensionality Reduction von Wang, Lipeng, Fei, Fei, Jie, Biao, Zhang, Daoqiang

“… Firstly, this method mines two groups of frequent subgraphs from positive and negative classes respectively, and then selects the most discriminative subgraphs using the subgraph selection algorithm …”
Volltext

Depression Classification Using Frequent Subgraph Mining Based on Pattern Growth of Frequent Edge in Functional Magnetic Resonance Imaging Uncertain Network von Li, Yao, Zhou, Zihao, Li, Qifan, Li, Tao, Julian, Ibegbu Nnamdi, Guo, Hao, Chen, Junjie

“… ; for example, the mining uncertain subgraph patterns (MUSE) method was used to mine frequent subgraphs and the discriminative feature selection for uncertain graph classification (DUG …”
Volltext

Overlapping Community Detection Algorithm Based on High-Quality Subgraph Extension in Local Core Regions of Network von Zhao, Yang, Deng, Kun, Liu, Xingyan, Yao, Jiqiang

“… of calculation caused by deleting nodes in the process of seed expansion. This paper proposes an overlapping community detection algorithm based on high-quality subgraph extension in local core regions of the network (OLCRE …”
Volltext

Android Malware Familial Classification and Representative Sample Selection via Frequent Subgraph Analysis von Fan, Ming, Liu, Jun, Luo, Xiapu, Chen, Kai, Tian, Zhenzhou, Zheng, Qinghua, Liu, Ting

“… approach for accelerating malware analysis. Furthermore, the selection of representative malware samples in each family can drastically decrease the number of malware to be analyzed …”
Volltext