从对称矩阵中枚举极大双列的一种新算法

2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI:10.1109/EAIT.2012.6407897

M. D. Savio, A. Sankar, R. V. Nataraj

{"title":"从对称矩阵中枚举极大双列的一种新算法","authors":"M. D. Savio, A. Sankar, R. V. Nataraj","doi":"10.1109/EAIT.2012.6407897","DOIUrl":null,"url":null,"abstract":"We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel algorithm for enumerating maximal bicliques from a symmetric matrix\",\"authors\":\"M. D. Savio, A. Sankar, R. V. Nataraj\",\"doi\":\"10.1109/EAIT.2012.6407897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.\",\"PeriodicalId\":194103,\"journal\":{\"name\":\"2012 Third International Conference on Emerging Applications of Information Technology\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Emerging Applications of Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EAIT.2012.6407897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Emerging Applications of Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EAIT.2012.6407897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们讨论了从对称矩阵中枚举极大双列的问题。我们提出了一种新的算法TWINBLADE，它利用对称矩阵的特性，在很大程度上减少了搜索空间，并且不产生一个重复。将我们的算法与LCM-MBC算法进行了比较，在实验中，我们的算法对于稀疏数据集的运行时间几乎只有LCM-MBC算法的一半，对于密集数据集的运行时间相对更好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A novel algorithm for enumerating maximal bicliques from a symmetric matrix

We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Third International Conference on Emerging Applications of Information Technology

自引率

0.00%

发文量