Search Results - Subgraph selection algorithm

Refine Results
  1. 1

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

    ISSN: 1945-8452
    Published: IEEE 27.05.2024
    “… In this paper, a self-adaptive subgraph generation algorithm for EEG channel selection (SSGE), built on the base of graph convolution network (GCN…”
    Get full text
    Conference Proceeding
  2. 2

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

    ISSN: 1383-7621, 1873-6165
    Published: Elsevier B.V 01.05.2017
    Published in Journal of systems architecture (01.05.2017)
    “… Determining parts of application code as custom instruction generally requires subgraph enumeration and subgraph selection…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 1041-4347, 1558-2191
    Published: New York IEEE 01.01.2017
    “… In this paper, we propose a primal-dual incremental subgraph feature selection algorithm (ISF) based on a max-margin graph classifier…”
    Get full text
    Journal Article
  4. 4

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

    ISSN: 0271-4302
    Published: IEEE 01.06.2014
    “…It is increasingly common to see custom operators appear in various fields of circuit design. Custom operators that can be implemented in special hardware…”
    Get full text
    Conference Proceeding
  5. 5

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

    ISSN: 1999-4893, 1999-4893
    Published: Basel MDPI AG 01.01.2023
    Published in Algorithms (01.01.2023)
    “… To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature clusters…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 1091-6490, 1091-6490
    Published: United States 02.11.2021
    “… We propose two algorithms that perform clustering on several small subgraphs and finally patch the results into a single clustering…”
    Get more information
    Journal Article
  7. 7

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

    ISBN: 146730283X, 9781467302838
    Published: IEEE 01.02.2012
    “…In this paper considered two modifications of the algorithm for selection isomorphic subgraphs from graph…”
    Get full text
    Conference Proceeding
  8. 8

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

    ISSN: 0167-739X, 1872-7115
    Published: Elsevier B.V 01.11.2020
    Published in Future generation computer systems (01.11.2020)
    “…Due to the acceleration of urbanization process in modern society, there are many metropolises throughout the world, such as New York, Tokyo, and Shanghai…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 0306-4379, 1873-6076
    Published: Oxford Elsevier Ltd 01.09.2017
    Published in Information systems (Oxford) (01.09.2017)
    “…•Existing feature selection algorithms are facing a scalability challenge.•We propose MR-SimLab, a MapReduce-based subgraph selection approach for big data…”
    Get full text
    Journal Article
  10. 10

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

    ISSN: 0020-0255, 1872-6291
    Published: Elsevier Inc 01.08.2021
    Published in Information sciences (01.08.2021)
    “…In this paper, a novel approach of supervised feature selection is proposed based on the principle of dense subgraph discovery…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 0141-9331, 1872-9436
    Published: Elsevier B.V 01.08.2016
    Published in Microprocessors and microsystems (01.08.2016)
    “…: 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…”
    Get full text
    Journal Article
  12. 12

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

    ISSN: 1041-4347
    Published: IEEE 01.09.2015
    “… 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…”
    Get full text
    Journal Article
  13. 13

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

    ISSN: 1573-7721, 1380-7501, 1573-7721
    Published: New York Springer US 01.08.2024
    Published in Multimedia tools and applications (01.08.2024)
    “… Selecting an optimal vertex-searching order can greatly improve a subgraph searching algorithm's effectiveness, yet a comprehensive theory for this selection is lacking…”
    Get full text
    Journal Article
  14. 14

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

    ISSN: 1932-6203, 1932-6203
    Published: San Francisco Public Library of Science 12.08.2022
    Published in PloS one (12.08.2022)
    “… 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…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 0167-8655, 1872-7344
    Published: Elsevier B.V 15.04.2014
    Published in Pattern recognition letters (15.04.2014)
    “…•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…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 1662-453X, 1662-4548, 1662-453X
    Published: Switzerland Frontiers Media S.A 29.04.2022
    Published in Frontiers in neuroscience (29.04.2022)
    “…; 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…”
    Get full text
    Journal Article
  17. 17

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

    ISSN: 1530-8669, 1530-8677
    Published: Oxford Hindawi 2023
    “… 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…”
    Get full text
    Journal Article
  18. 18

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

    ISSN: 1556-6013, 1556-6021
    Published: IEEE 01.08.2018
    “… 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…”
    Get full text
    Journal Article
  19. 19

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

    ISSN: 1002-137X
    Published: Editorial office of Computer Science 01.09.2021
    Published in Ji suan ji ke xue (01.09.2021)
    “…Local community detection algorithms usually select seed nodes for community detection.To improve the quality of effectiveness of seed node selection,we propose…”
    Get full text
    Journal Article
  20. 20

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

    ISSN: 1673-9418
    Published: 01.10.2014
    “… 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…”
    Get full text
    Journal Article