{"id":"https://openalex.org/W1561833014","doi":"https://doi.org/10.1109/icassp.2015.7179041","title":"Efficient detection and localization on graph structured data","display_name":"Efficient detection and localization on graph structured data","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1561833014","doi":"https://doi.org/10.1109/icassp.2015.7179041","mag":"1561833014"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2015.7179041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2015.7179041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057858044","display_name":"Manjesh K. Hanawal","orcid":"https://orcid.org/0000-0002-1807-5487"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manjesh Kumar Hanawal","raw_affiliation_strings":["Boston University, Massachusetts, USA","[Boston University, Massachusetts, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Massachusetts, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"[Boston University, Massachusetts, USA]","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048704387","display_name":"Venkatesh Saligrama","orcid":"https://orcid.org/0000-0002-0675-2268"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesh Saligrama","raw_affiliation_strings":["Boston University, Massachusetts, USA","[Boston University, Massachusetts, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Massachusetts, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"[Boston University, Massachusetts, USA]","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5590","last_page":"5594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.806372880935669},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7353403568267822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5939396023750305},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5628024339675903},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.46543067693710327},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42104658484458923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4129769802093506},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4042814373970032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40117383003234863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29683220386505127},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16384735703468323},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10096454620361328}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.806372880935669},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7353403568267822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5939396023750305},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5628024339675903},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.46543067693710327},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42104658484458923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4129769802093506},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4042814373970032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40117383003234863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29683220386505127},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16384735703468323},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10096454620361328},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2015.7179041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2015.7179041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.8190","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.8190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bu.edu/phpbin/cise/download.php?tracking_number%3D2015-CA-0001","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W50486269","https://openalex.org/W1491300635","https://openalex.org/W1822035899","https://openalex.org/W2024661490","https://openalex.org/W2029241234","https://openalex.org/W2030319053","https://openalex.org/W2061753713","https://openalex.org/W2104290444","https://openalex.org/W2112420033","https://openalex.org/W2119699244","https://openalex.org/W2120785704","https://openalex.org/W2121223271","https://openalex.org/W2126523478","https://openalex.org/W2146461364","https://openalex.org/W2149571656","https://openalex.org/W2165856466","https://openalex.org/W2997701990","https://openalex.org/W3124176337","https://openalex.org/W4299548526","https://openalex.org/W6602031475","https://openalex.org/W6638299580","https://openalex.org/W6675747103","https://openalex.org/W6684554974"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3088754131","https://openalex.org/W3038848193"],"abstract_inverted_index":{"The":[0,94],"problem":[1],"of":[2,6,12,17,35,39,51,57,73,96,102],"efficiently":[3],"identifying":[4],"regions":[5,107],"interest":[7,62],"arises":[8],"in":[9,33],"the":[10,55,78,83,97,100,103,129,137],"context":[11],"surveillance,":[13],"monitoring":[14],"and":[15,80],"exploration":[16],"a":[18,52],"large":[19],"area":[20],"or":[21],"network":[22,27],"involving":[23],"social,":[24],"sensor,":[25],"communication":[26],"data.":[28],"We":[29,64],"formulate":[30],"these":[31,58],"problems":[32],"terms":[34],"locating":[36],"optimum":[37],"values":[38],"signals":[40],"on":[41,77,128],"graphs.":[42],"In":[43],"this":[44],"perspective":[45],"we":[46,131],"associate":[47],"features":[48,59],"with":[49,105,121,144],"nodes/edges":[50],"graph":[53,79],"where":[54],"maxima/minima":[56],"correspond":[60],"to":[61,109,115],"points.":[63],"develop":[65],"an":[66],"algorithm":[67],"that":[68,133],"adaptively":[69],"probes":[70],"local":[71],"sub-collection":[72],"nodes":[74],"(local":[75],"regions)":[76],"sequentially":[81],"refines":[82],"search":[84],"space":[85],"from":[86,90],"noisy":[87],"averaged":[88],"returns":[89],"each":[91],"probed":[92],"region.":[93],"size":[95],"region":[98],"determines":[99],"cost":[101,146],"probe":[104],"larger":[106],"corresponding":[108],"lower":[110],"cost.":[111],"Our":[112],"goal":[113],"is":[114],"minimize":[116],"regret":[117,139],"after":[118,134],"T":[119,135],"rounds":[120,136],"minimal":[122],"budget/cost.":[123],"Under":[124],"suitable":[125],"smoothness":[126],"conditions":[127],"signal":[130],"show":[132],"cumulative":[138],"scales":[140],"optimally":[141],"as":[142],"O(equation)":[143],"significant":[145],"gain":[147],"over":[148],"other":[149],"state-of-art":[150],"techniques.":[151]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}