MIDAS: Multilinear detection at scale
We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are fundamental problems in a broad class of applications. Most of the parallel algorithms for such problems are either based on heuristics, which do not...
Saved in:
| Published in: | Journal of parallel and distributed computing Vol. 132; no. C; pp. 363 - 382 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
Elsevier Inc
01.10.2019
Elsevier |
| Subjects: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are fundamental problems in a broad class of applications. Most of the parallel algorithms for such problems are either based on heuristics, which do not scale very well, or use techniques like color coding, which have a high memory overhead. In this paper, we develop a novel approach for parallelizing both these classes of problems, using an algebraic representation of subgraphs as monomials—this methodology involves detecting multilinear terms in multivariate polynomials. Our algorithms show good scaling over a large regime, and they run on networks with close to half one billion edges. The resulting parallel algorithm for trees is able to scale to subgraphs of size 18, which has not been done before, and it significantly outperforms the best prior color coding based method (FASCIA) by more than two orders of magnitude. Our algorithm for network scan statistics is the first such parallelization, and it is able to handle a broad class of scan statistics functions with the same approach.
•Finding subgraphs is an important primitive in network analysis.•It is possible to find “small” subgraphs optimally, but it takes exponential time.•Existing parallel algorithms find subgraphs of size up to 12.•We propose a distributed algorithm that scales to subgraphs of size 18.•Our algorithm can be applied to find subtrees and for anomaly detection tasks. |
|---|---|
| AbstractList | We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are fundamental problems in a broad class of applications. Most of the parallel algorithms for such problems are either based on heuristics, which do not scale very well, or use techniques like color coding, which have a high memory overhead. In this paper, we develop a novel approach for parallelizing both these classes of problems, using an algebraic representation of subgraphs as monomials—this methodology involves detecting multilinear terms in multivariate polynomials. Our algorithms show good scaling over a large regime, and they run on networks with close to half one billion edges. The resulting parallel algorithm for trees is able to scale to subgraphs of size 18, which has not been done before, and it significantly outperforms the best prior color coding based method (FASCIA) by more than two orders of magnitude. Our algorithm for network scan statistics is the first such parallelization, and it is able to handle a broad class of scan statistics functions with the same approach.
•Finding subgraphs is an important primitive in network analysis.•It is possible to find “small” subgraphs optimally, but it takes exponential time.•Existing parallel algorithms find subgraphs of size up to 12.•We propose a distributed algorithm that scales to subgraphs of size 18.•Our algorithm can be applied to find subtrees and for anomaly detection tasks. |
| Author | Cadena, Jose Ekanayake, Saliya Vullikanti, Anil Wickramasinghe, Udayanga |
| Author_xml | – sequence: 1 givenname: Saliya surname: Ekanayake fullname: Ekanayake, Saliya email: esaliya@lbl.gov organization: Lawrence Berkeley National Laboratory, United States – sequence: 2 givenname: Jose surname: Cadena fullname: Cadena, Jose email: cadenapico1@llnl.gov organization: Lawrence Livermore National Laboratory, United States – sequence: 3 givenname: Udayanga surname: Wickramasinghe fullname: Wickramasinghe, Udayanga email: uswickra@iu.edu organization: Indiana University, United States – sequence: 4 givenname: Anil surname: Vullikanti fullname: Vullikanti, Anil email: vsakumar@virginia.edu organization: University of Virginia, United States |
| BackLink | https://www.osti.gov/biblio/1530915$$D View this record in Osti.gov |
| BookMark | eNp9kEtLxDAUhYOMYGf0D7gqgsvWm3crbobxNTCDC3Ud0iTFlJoOSRX897aMazf3bO53OHxLtAhDcAhdYigxYHHTld3BmpIArktgJYA4QRmGWhRQsWqBMpCMFpJifoaWKXUAGHNZZeh6v71fv97m-69-9L0PTsfcutGZ0Q8h12OejO7dOTptdZ_cxV-u0Pvjw9vmudi9PG03611hKCFjQbmwWmhtibSs5W0jpSEVMUZQ0VjOBOeNdY012nCCNa0J06Z1VrKqBVnVdIWujr1DGr1Kxk9DPswQwrRHYU6hns4KkeOTiUNK0bXqEP2njj8Kg5ptqE7NNtRsQwFTk40JujtCbpr_7V2c210wzvo4l9vB_4f_ArKtaNw |
| Cites_doi | 10.1109/BigDataService.2016.11 10.1002/cpe.3769 10.1007/s00453-007-9008-7 10.1109/WSC.2009.5429425 10.1111/j.1467-9868.2011.01014.x 10.1145/210332.210337 10.1145/2339530.2339724 10.1038/ng.3168 10.1007/s10618-014-0365-y 10.1080/03610929708831995 10.1016/j.jpdc.2009.01.003 10.1093/bioinformatics/btn163 10.1080/00401706.2013.822830 10.1080/10618600.2014.960926 10.1137/0208032 10.1016/S0167-9473(02)00160-3 10.1542/peds.2014-2715 10.29007/6xgg 10.1007/BF00533250 10.1198/106186006X112396 10.1016/j.ipl.2008.11.004 |
| ContentType | Journal Article |
| Copyright | 2019 |
| Copyright_xml | – notice: 2019 |
| DBID | AAYXX CITATION OTOTI |
| DOI | 10.1016/j.jpdc.2019.04.006 |
| DatabaseName | CrossRef OSTI.GOV |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 382 |
| ExternalDocumentID | 1530915 10_1016_j_jpdc_2019_04_006 S0743731518305239 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD OTOTI |
| ID | FETCH-LOGICAL-c322t-356da6aad27d4f5fb77c282cc636bd54655bdebdcac521a3924acfed748f07893 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000476580400029&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Mon Mar 25 05:13:58 EDT 2024 Sat Nov 29 07:14:55 EST 2025 Fri Feb 23 02:31:21 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | C |
| Keywords | Subgraph isomorphism Distributed graph algorithms Graph scan statistics Parameterized complexity Multilinear detection |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c322t-356da6aad27d4f5fb77c282cc636bd54655bdebdcac521a3924acfed748f07893 |
| Notes | USDOE |
| OpenAccessLink | https://www.osti.gov/biblio/1530915 |
| PageCount | 20 |
| ParticipantIDs | osti_scitechconnect_1530915 crossref_primary_10_1016_j_jpdc_2019_04_006 elsevier_sciencedirect_doi_10_1016_j_jpdc_2019_04_006 |
| PublicationCentury | 2000 |
| PublicationDate | October 2019 2019-10-00 2019-10-01 |
| PublicationDateYYYYMMDD | 2019-10-01 |
| PublicationDate_xml | – month: 10 year: 2019 text: October 2019 |
| PublicationDecade | 2010 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2019 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Lieu, Ray, Klein, Chung, Kulldorff (b28) 2015; 135 Alon, Dao, Hajirasouliha, Hormozdiari, Sahinalp (b3) 2008; 24 Neil, Hash, Brugh, Fisk, Storlie (b31) 2013; 55 Du, Wu, Xu, Wang, Xin (b14) 2009 Garey (b19) 1979 Hansen, Vandin (b22) 2016 Williams (b42) 2009; 109 Speakman, McFowland III, Neill (b38) 2015; 24 Sharpnack, Singh, Rinaldo (b34) 2012 Duczmal, Kulldorff, Huang (b15) 2006; 15 Björklund, Kaski, Kowalik (b9) 2014 Slota, Madduri (b36) 2013 Slota, Madduri (b37) 2014 Neill (b32) 2012; 74 Elseidy, Abdelhamid, Skiadopoulos, Kalnis (b18) 2014 J. Cheng, L. Zhu, Y. Ke, S. Chu, Fast algorithms for maximal clique enumeration with limited memory, in: Proc. SIGKDD, 2012. J.E. Gonzalez, R.S. Xin, A. Dave, D. Crankshaw, M.J. Franklin, I. Stoica, GraphX: graph processing in a distributed dataflow framework, in: Proc OSDI, 2014. Leiserson, Vandin, Wu, Dobson, Eldridge, Thomas, Papoutsaki, Kim, Niu, McLellan (b27) 2015; 47 Berk, Jones (b8) 1979; 47 Akoglu, Tong, Koutra (b2) 2015; 29 Abdelhamid, Abdelaziz, Kalnis, Khayyat, Jamour (b1) 2016 McFowland, Speakman, Neill (b29) 2013; 14 Mullen, Mummert (b30) 2007; 3 C.L. Barrett, R.J. Beckman, M. Khan, V.A. Kumar, M.V. Marathe, P.E. Stretz, T. Dutta, B. Lewis, Generation and analysis of large synthetic social contact networks, in: Winter Simulation Conference, 2009. Zhao, Li, Zhou, Chen, Tomchik, Ju (b43) 2017; 29 Arifuzzaman, Khan, Marathe (b6) 2013 Zhao, Wang, Butt, Khan, Kumar, Marathe (b44) 2012 Koutis (b24) 2008 Kulldorff, Tango, Park (b26) 2003; 42 Kulldorff (b25) 1997; 26 Sharpnack, Singh, Rinaldo (b35) 2013 Cadena, Chen, Vullikanti (b10) 2017 Aparicio, Ribeiro, da Silva (b5) 2014 Chakaravarthy, Kapralov, Murali, Petrini, Que, Sabharwal, Schieber (b11) 2016 J.E. Gonzalez, Y. Low, H. Gu, D. Bickson, C. Guestrin, PowerGraph: distributed graph-parallel computation on natural graphs, in: Proc. OSDI, 2012. Schmidt, Samatova, Thomas, Park (b33) 2009; 69 Valiant (b40) 1979; 8 Chen, Neill (b12) 2014 Alon, Yuster, Zwick (b4) 1995; 42 S. Ekanayake, J. Cadena, U. Wickramasinghe, A.K. Vullikanti, MIDAS: multilinear detection at scale, in: The Proceedings of 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018. Speakman, Zhang, Neill (b39) 2013 S. Ekanayake, J. Cadena, A. Vullikanti, Fast graph scan statistics optimization using algebraic fingerprints, in: Proc. IEEE BigData, 2017. J. Wei, K. Chen, Y. Zhou, Q. Zhou, J. He, Benchmarking of distributed computing engines: spark and graphlab for big data analytics, in: Proc. IEEE BigData, 2016. Hüffner, Wernicke, Zichner (b23) 2008; 52 Mullen (10.1016/j.jpdc.2019.04.006_b30) 2007; 3 Kulldorff (10.1016/j.jpdc.2019.04.006_b26) 2003; 42 Lieu (10.1016/j.jpdc.2019.04.006_b28) 2015; 135 Aparicio (10.1016/j.jpdc.2019.04.006_b5) 2014 Neil (10.1016/j.jpdc.2019.04.006_b31) 2013; 55 Sharpnack (10.1016/j.jpdc.2019.04.006_b35) 2013 Alon (10.1016/j.jpdc.2019.04.006_b4) 1995; 42 10.1016/j.jpdc.2019.04.006_b16 10.1016/j.jpdc.2019.04.006_b13 10.1016/j.jpdc.2019.04.006_b17 Garey (10.1016/j.jpdc.2019.04.006_b19) 1979 Björklund (10.1016/j.jpdc.2019.04.006_b9) 2014 McFowland (10.1016/j.jpdc.2019.04.006_b29) 2013; 14 Berk (10.1016/j.jpdc.2019.04.006_b8) 1979; 47 Koutis (10.1016/j.jpdc.2019.04.006_b24) 2008 Valiant (10.1016/j.jpdc.2019.04.006_b40) 1979; 8 Alon (10.1016/j.jpdc.2019.04.006_b3) 2008; 24 Hansen (10.1016/j.jpdc.2019.04.006_b22) 2016 Zhao (10.1016/j.jpdc.2019.04.006_b44) 2012 Chen (10.1016/j.jpdc.2019.04.006_b12) 2014 Neill (10.1016/j.jpdc.2019.04.006_b32) 2012; 74 Chakaravarthy (10.1016/j.jpdc.2019.04.006_b11) 2016 10.1016/j.jpdc.2019.04.006_b7 Leiserson (10.1016/j.jpdc.2019.04.006_b27) 2015; 47 Elseidy (10.1016/j.jpdc.2019.04.006_b18) 2014 Akoglu (10.1016/j.jpdc.2019.04.006_b2) 2015; 29 Du (10.1016/j.jpdc.2019.04.006_b14) 2009 Arifuzzaman (10.1016/j.jpdc.2019.04.006_b6) 2013 Duczmal (10.1016/j.jpdc.2019.04.006_b15) 2006; 15 Speakman (10.1016/j.jpdc.2019.04.006_b38) 2015; 24 Cadena (10.1016/j.jpdc.2019.04.006_b10) 2017 Kulldorff (10.1016/j.jpdc.2019.04.006_b25) 1997; 26 Speakman (10.1016/j.jpdc.2019.04.006_b39) 2013 Slota (10.1016/j.jpdc.2019.04.006_b36) 2013 Slota (10.1016/j.jpdc.2019.04.006_b37) 2014 10.1016/j.jpdc.2019.04.006_b41 10.1016/j.jpdc.2019.04.006_b20 10.1016/j.jpdc.2019.04.006_b21 Williams (10.1016/j.jpdc.2019.04.006_b42) 2009; 109 Zhao (10.1016/j.jpdc.2019.04.006_b43) 2017; 29 Schmidt (10.1016/j.jpdc.2019.04.006_b33) 2009; 69 Hüffner (10.1016/j.jpdc.2019.04.006_b23) 2008; 52 Abdelhamid (10.1016/j.jpdc.2019.04.006_b1) 2016 Sharpnack (10.1016/j.jpdc.2019.04.006_b34) 2012 |
| References_xml | – year: 2013 ident: b35 article-title: Changepoint detection over graphs with the spectral scan statistic publication-title: AISTATS – year: 2013 ident: b39 article-title: Dynamic pattern detection with temporal consistency and connectivity constraints publication-title: ICDM – year: 2008 ident: b24 article-title: Faster algebraic algorithms for path and packing problems publication-title: Proc. ICALP – volume: 26 start-page: 1481 year: 1997 end-page: 1496 ident: b25 article-title: A spatial scan statistic publication-title: Comm. Statist. Theory Methods – volume: 47 start-page: 47 year: 1979 end-page: 59 ident: b8 article-title: Goodness-of-fit test statistics that dominate the kolmogorov statistics publication-title: Z. Wahrscheinlichkeitstheor. Verwandte Geb. – reference: J. Wei, K. Chen, Y. Zhou, Q. Zhou, J. He, Benchmarking of distributed computing engines: spark and graphlab for big data analytics, in: Proc. IEEE BigData, 2016. – start-page: 149 year: 2014 end-page: 160 ident: b9 article-title: Fast witness extraction using a decision oracle publication-title: European Symposium on Algorithms – volume: 135 start-page: 280 year: 2015 end-page: 289 ident: b28 article-title: Geographic clusters in underimmunization and vaccine refusal publication-title: Pediatrics – start-page: 390 year: 2012 end-page: 401 ident: b44 article-title: Sahad: subgraph analysis in massive networks using hadoop publication-title: Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International – volume: 29 start-page: 626 year: 2015 end-page: 688 ident: b2 article-title: Graph based anomaly detection and description: a survey publication-title: Data Min. Knowl. Discov. – year: 2016 ident: b22 article-title: Finding mutated subnetworks associated with survival in cancer – volume: 14 start-page: 1533 year: 2013 end-page: 1561 ident: b29 article-title: Fast generalized subset scan for anomalous pattern detection publication-title: J. Mach. Learn. Res. – volume: 109 start-page: 315 year: 2009 end-page: 318 ident: b42 article-title: Finding paths of length k in publication-title: Inform. Process. Lett. – volume: 29 year: 2017 ident: b43 article-title: Parallel algorithms for anomalous subgraph detection publication-title: Concurr. Comput.: Pract. Exper. – reference: C.L. Barrett, R.J. Beckman, M. Khan, V.A. Kumar, M.V. Marathe, P.E. Stretz, T. Dutta, B. Lewis, Generation and analysis of large synthetic social contact networks, in: Winter Simulation Conference, 2009. – reference: S. Ekanayake, J. Cadena, U. Wickramasinghe, A.K. Vullikanti, MIDAS: multilinear detection at scale, in: The Proceedings of 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018. – year: 2017 ident: b10 article-title: Near-optimal and practical algorithms for graph scan statistics publication-title: SIAM Data Mining (SDM) – reference: J.E. Gonzalez, Y. Low, H. Gu, D. Bickson, C. Guestrin, PowerGraph: distributed graph-parallel computation on natural graphs, in: Proc. OSDI, 2012. – volume: 74 start-page: 337 year: 2012 end-page: 360 ident: b32 article-title: Fast subset scan for spatial pattern detection publication-title: J. R. Stat. Soc. Ser. B Stat. Methodol. – year: 2014 ident: b37 article-title: Complex network analysis using parallel approximate motif counting publication-title: IEEE IPDPS – volume: 42 start-page: 844 year: 1995 end-page: 856 ident: b4 article-title: Color-coding publication-title: J. ACM – reference: S. Ekanayake, J. Cadena, A. Vullikanti, Fast graph scan statistics optimization using algebraic fingerprints, in: Proc. IEEE BigData, 2017. – year: 1979 ident: b19 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 55 start-page: 403 year: 2013 end-page: 414 ident: b31 article-title: Scan statistics for the online detection of locally anomalous subgraphs publication-title: Technometrics – reference: J. Cheng, L. Zhu, Y. Ke, S. Chu, Fast algorithms for maximal clique enumeration with limited memory, in: Proc. SIGKDD, 2012. – year: 2014 ident: b18 article-title: Grami: frequent subgraph and pattern mining in a single large graph publication-title: VLDB – year: 2013 ident: b6 article-title: Patric: a parallel algorithm for counting triangles in massive networks publication-title: CIKM – volume: 24 start-page: i241 year: 2008 end-page: i249 ident: b3 article-title: Biomolecular network motif counting and discovery by color coding publication-title: Bioinformatics – year: 2016 ident: b1 article-title: Scalemine: scalable parallel frequent subgraph mining in a single large graph publication-title: SC – start-page: 2 year: 2016 end-page: 11 ident: b11 article-title: Subgraph counting: color coding beyond trees publication-title: Parallel and Distributed Processing Symposium, 2016 IEEE International – year: 2012 ident: b34 article-title: Sparsistency of the edge lasso over graphs. publication-title: AISTATS – volume: 15 start-page: 428 year: 2006 end-page: 442 ident: b15 article-title: Evaluation of spatial scan statistics for irregularly shaped clusters publication-title: J. Comput. Graph. Statist. – volume: 52 start-page: 114 year: 2008 end-page: 132 ident: b23 article-title: Algorithm engineering for color-coding with applications to signaling pathway detection publication-title: Algorithmica – volume: 3 start-page: 19 year: 2007 end-page: 20 ident: b30 article-title: Finite fields and applications publication-title: Amer. Math. Soc. – year: 2014 ident: b12 article-title: Non-parametric scan statistics for event detection and forecasting in heterogeneous social media graphs publication-title: KDD – reference: J.E. Gonzalez, R.S. Xin, A. Dave, D. Crankshaw, M.J. Franklin, I. Stoica, GraphX: graph processing in a distributed dataflow framework, in: Proc OSDI, 2014. – year: 2014 ident: b5 article-title: Parallel subgraph counting for multicore architectures publication-title: IEEE ISPA – volume: 47 start-page: 106 year: 2015 end-page: 114 ident: b27 article-title: Pan-cancer network analysis identifies combinations of rare somatic mutations across pathways and protein complexes publication-title: Nature Genet. – volume: 69 start-page: 417 year: 2009 end-page: 428 ident: b33 article-title: A scalable, parallel algorithm for maximal clique enumeration publication-title: J. Parallel Distrib. Comput. – start-page: 207 year: 2009 end-page: 221 ident: b14 article-title: Parallel algorithm for enumerating maximal cliques in complex network publication-title: Min. Complex Data – volume: 8 start-page: 410 year: 1979 end-page: 421 ident: b40 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. – volume: 42 start-page: 665 year: 2003 end-page: 684 ident: b26 article-title: Power comparisons for disease clustering tests publication-title: Comput. Statist. Data Anal. – year: 2013 ident: b36 article-title: Fast approximate subgraph counting and enumeration publication-title: ICPP – volume: 24 start-page: 1014 year: 2015 end-page: 1033 ident: b38 article-title: Scalable detection of anomalous patterns with connectivity constraints publication-title: J. Comput. Graph. Statist. – ident: 10.1016/j.jpdc.2019.04.006_b41 doi: 10.1109/BigDataService.2016.11 – year: 2012 ident: 10.1016/j.jpdc.2019.04.006_b34 article-title: Sparsistency of the edge lasso over graphs. – volume: 29 issue: 3 year: 2017 ident: 10.1016/j.jpdc.2019.04.006_b43 article-title: Parallel algorithms for anomalous subgraph detection publication-title: Concurr. Comput.: Pract. Exper. doi: 10.1002/cpe.3769 – year: 2017 ident: 10.1016/j.jpdc.2019.04.006_b10 article-title: Near-optimal and practical algorithms for graph scan statistics – start-page: 2 year: 2016 ident: 10.1016/j.jpdc.2019.04.006_b11 article-title: Subgraph counting: color coding beyond trees – volume: 52 start-page: 114 issue: 2 year: 2008 ident: 10.1016/j.jpdc.2019.04.006_b23 article-title: Algorithm engineering for color-coding with applications to signaling pathway detection publication-title: Algorithmica doi: 10.1007/s00453-007-9008-7 – start-page: 149 year: 2014 ident: 10.1016/j.jpdc.2019.04.006_b9 article-title: Fast witness extraction using a decision oracle – year: 1979 ident: 10.1016/j.jpdc.2019.04.006_b19 – year: 2016 ident: 10.1016/j.jpdc.2019.04.006_b22 – ident: 10.1016/j.jpdc.2019.04.006_b20 – start-page: 390 year: 2012 ident: 10.1016/j.jpdc.2019.04.006_b44 article-title: Sahad: subgraph analysis in massive networks using hadoop – ident: 10.1016/j.jpdc.2019.04.006_b7 doi: 10.1109/WSC.2009.5429425 – volume: 74 start-page: 337 issue: 2 year: 2012 ident: 10.1016/j.jpdc.2019.04.006_b32 article-title: Fast subset scan for spatial pattern detection publication-title: J. R. Stat. Soc. Ser. B Stat. Methodol. doi: 10.1111/j.1467-9868.2011.01014.x – year: 2014 ident: 10.1016/j.jpdc.2019.04.006_b37 article-title: Complex network analysis using parallel approximate motif counting – year: 2014 ident: 10.1016/j.jpdc.2019.04.006_b12 article-title: Non-parametric scan statistics for event detection and forecasting in heterogeneous social media graphs – year: 2016 ident: 10.1016/j.jpdc.2019.04.006_b1 article-title: Scalemine: scalable parallel frequent subgraph mining in a single large graph – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 10.1016/j.jpdc.2019.04.006_b4 article-title: Color-coding publication-title: J. ACM doi: 10.1145/210332.210337 – ident: 10.1016/j.jpdc.2019.04.006_b13 doi: 10.1145/2339530.2339724 – year: 2014 ident: 10.1016/j.jpdc.2019.04.006_b5 article-title: Parallel subgraph counting for multicore architectures – year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b6 article-title: Patric: a parallel algorithm for counting triangles in massive networks – year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b35 article-title: Changepoint detection over graphs with the spectral scan statistic – year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b36 article-title: Fast approximate subgraph counting and enumeration – volume: 47 start-page: 106 issue: 2 year: 2015 ident: 10.1016/j.jpdc.2019.04.006_b27 article-title: Pan-cancer network analysis identifies combinations of rare somatic mutations across pathways and protein complexes publication-title: Nature Genet. doi: 10.1038/ng.3168 – volume: 29 start-page: 626 issue: 3 year: 2015 ident: 10.1016/j.jpdc.2019.04.006_b2 article-title: Graph based anomaly detection and description: a survey publication-title: Data Min. Knowl. Discov. doi: 10.1007/s10618-014-0365-y – volume: 26 start-page: 1481 issue: 6 year: 1997 ident: 10.1016/j.jpdc.2019.04.006_b25 article-title: A spatial scan statistic publication-title: Comm. Statist. Theory Methods doi: 10.1080/03610929708831995 – volume: 3 start-page: 19 year: 2007 ident: 10.1016/j.jpdc.2019.04.006_b30 article-title: Finite fields and applications publication-title: Amer. Math. Soc. – volume: 69 start-page: 417 issue: 4 year: 2009 ident: 10.1016/j.jpdc.2019.04.006_b33 article-title: A scalable, parallel algorithm for maximal clique enumeration publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2009.01.003 – volume: 24 start-page: i241 issue: 13 year: 2008 ident: 10.1016/j.jpdc.2019.04.006_b3 article-title: Biomolecular network motif counting and discovery by color coding publication-title: Bioinformatics doi: 10.1093/bioinformatics/btn163 – volume: 55 start-page: 403 issue: 4 year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b31 article-title: Scan statistics for the online detection of locally anomalous subgraphs publication-title: Technometrics doi: 10.1080/00401706.2013.822830 – ident: 10.1016/j.jpdc.2019.04.006_b21 – volume: 24 start-page: 1014 issue: 4 year: 2015 ident: 10.1016/j.jpdc.2019.04.006_b38 article-title: Scalable detection of anomalous patterns with connectivity constraints publication-title: J. Comput. Graph. Statist. doi: 10.1080/10618600.2014.960926 – volume: 8 start-page: 410 issue: 3 year: 1979 ident: 10.1016/j.jpdc.2019.04.006_b40 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. doi: 10.1137/0208032 – year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b39 article-title: Dynamic pattern detection with temporal consistency and connectivity constraints – volume: 42 start-page: 665 issue: 4 year: 2003 ident: 10.1016/j.jpdc.2019.04.006_b26 article-title: Power comparisons for disease clustering tests publication-title: Comput. Statist. Data Anal. doi: 10.1016/S0167-9473(02)00160-3 – year: 2014 ident: 10.1016/j.jpdc.2019.04.006_b18 article-title: Grami: frequent subgraph and pattern mining in a single large graph – volume: 135 start-page: 280 issue: 2 year: 2015 ident: 10.1016/j.jpdc.2019.04.006_b28 article-title: Geographic clusters in underimmunization and vaccine refusal publication-title: Pediatrics doi: 10.1542/peds.2014-2715 – ident: 10.1016/j.jpdc.2019.04.006_b17 doi: 10.29007/6xgg – volume: 14 start-page: 1533 issue: 1 year: 2013 ident: 10.1016/j.jpdc.2019.04.006_b29 article-title: Fast generalized subset scan for anomalous pattern detection publication-title: J. Mach. Learn. Res. – volume: 47 start-page: 47 issue: 1 year: 1979 ident: 10.1016/j.jpdc.2019.04.006_b8 article-title: Goodness-of-fit test statistics that dominate the kolmogorov statistics publication-title: Z. Wahrscheinlichkeitstheor. Verwandte Geb. doi: 10.1007/BF00533250 – volume: 15 start-page: 428 issue: 2 year: 2006 ident: 10.1016/j.jpdc.2019.04.006_b15 article-title: Evaluation of spatial scan statistics for irregularly shaped clusters publication-title: J. Comput. Graph. Statist. doi: 10.1198/106186006X112396 – ident: 10.1016/j.jpdc.2019.04.006_b16 – volume: 109 start-page: 315 issue: 6 year: 2009 ident: 10.1016/j.jpdc.2019.04.006_b42 article-title: Finding paths of length k in O(2k) time publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2008.11.004 – start-page: 207 year: 2009 ident: 10.1016/j.jpdc.2019.04.006_b14 article-title: Parallel algorithm for enumerating maximal cliques in complex network publication-title: Min. Complex Data – year: 2008 ident: 10.1016/j.jpdc.2019.04.006_b24 article-title: Faster algebraic algorithms for path and packing problems |
| SSID | ssj0011578 |
| Score | 2.2303686 |
| Snippet | We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are... |
| SourceID | osti crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 363 |
| SubjectTerms | Distributed graph algorithms Graph scan statistics Multilinear detection Parameterized complexity Subgraph isomorphism |
| Title | MIDAS: Multilinear detection at scale |
| URI | https://dx.doi.org/10.1016/j.jpdc.2019.04.006 https://www.osti.gov/biblio/1530915 |
| Volume | 132 |
| WOSCitedRecordID | wos000476580400029&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT8MwDI7QxoELb8R4qQc4oaJ1bZqW28RDgAAh8dBuVZqkwIAybR2Cf4-dpB1vwYFLVVVy1Mau_cVxPhOy3vRVyELO3TAOUzeAkOymrKXcKI5oM8iyVCqt6WN2ehp1OvGZzekOdDsBlufR83Pc-1dVwzNQNh6d_YO6q0HhAdyD0uEKaofrrxR_crjbPseFvj5biyiSYxPwQtmm4MXmAPTyvgJohEqRCvz-XhkCAYmsutgQS-mzb71hUQY6xOB3POcv3Bb3AJx_GRX9cPBmvNxgGKV2xF2fP3DMTtxoqUsJA-TXldwV7kzBsKbEoJ3b8g-blPDiqryt9F3IfMp8c1KzcrQ2k2lcpW8dm4m6vmlB9Mmhm9xCd6vbk0g46cWamLb5BXv2h6hW1RqWZWzdBMdIcIykGSSap73eYjQGd15vH-51jqrdJ4-aCF5-hD1sZeoCP77Jd4Cm9gg--g1WuZgmk1adTtsYxwwZU_ksmSobeDjWn8-RDW0r284bS3EqS3F44WhLmSeX-3sXOweu7ZvhCnDPhevTUHL4_2SLySCjWcqYgJW1EKEfppIiYx78gqkUXAB444CQAy4yJVkQZdh9wF8gtfwxV4vEAfjoyVBkaYR5A1iby4BlMeNMeTKIqGyQzfLjk56hR0m-n_AGoeX8JBbgGeCWgLp_lFvGyUQZZDYWWAIGQhCsAe3SpT-9wzKZGBnsCqkV_aFaJePiqbgd9NesJbwCwhF5qw |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=MIDAS%3A+Multilinear+detection+at+scale&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Ekanayake%2C+Saliya&rft.au=Cadena%2C+Jose&rft.au=Wickramasinghe%2C+Udayanga&rft.au=Vullikanti%2C+Anil&rft.date=2019-10-01&rft.issn=0743-7315&rft.volume=132&rft.spage=363&rft.epage=382&rft_id=info:doi/10.1016%2Fj.jpdc.2019.04.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jpdc_2019_04_006 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |