{"id":"https://openalex.org/W2896429528","doi":null,"title":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms with Applications to Fraud Detection","display_name":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms with Applications to Fraud Detection","publication_year":2018,"publication_date":"2018-10-16","ids":{"openalex":"https://openalex.org/W2896429528","mag":"2896429528"},"language":"en","primary_location":{"id":"mag:2896429528","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1810.06809","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1810.06809","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047387636","display_name":"Yikun Ban","orcid":"https://orcid.org/0000-0003-3035-4849","observed_orcids":["https://orcid.org/0000-0003-3035-4849"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yikun Ban","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108663480","display_name":"Yitao Duan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yitao Duan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ling Huang","orcid":"https://orcid.org/0000-0003-1562-1371","observed_orcids":["https://orcid.org/0000-0003-1562-1371"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ling Huang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1562-1371","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9589999914169312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9589999914169312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.02800000086426735,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.004399999976158142,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dense-subgraph-mining","display_name":"dense subgraph mining","score":0.9869999885559082},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.9990000128746033},{"id":"https://openalex.org/keywords/fraud-detection","display_name":"fraud detection","score":0.8769999742507935},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.7839999794960022},{"id":"https://openalex.org/keywords/feature-combination","display_name":"feature combination","score":0.6420000195503235}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8926445245742798},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6784632205963135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6335065960884094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5532547235488892},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4519122540950775},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.43303459882736206},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4097096920013428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40164220333099365},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.327178955078125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26081860065460205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22785872220993042},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2896429528","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1810.06809","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2896429528","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1810.06809","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1502940150","https://openalex.org/W1535144194","https://openalex.org/W1845137714","https://openalex.org/W1868111879","https://openalex.org/W1952056635","https://openalex.org/W1995875735","https://openalex.org/W2005556331","https://openalex.org/W2011863672","https://openalex.org/W2024165284","https://openalex.org/W2036512590","https://openalex.org/W2061344791","https://openalex.org/W2064058256","https://openalex.org/W2064853889","https://openalex.org/W2079535727","https://openalex.org/W2100409033","https://openalex.org/W2101447063","https://openalex.org/W2125490153","https://openalex.org/W2132938399","https://openalex.org/W2133591726","https://openalex.org/W2138621811","https://openalex.org/W2148123869","https://openalex.org/W2150718242","https://openalex.org/W2162034534","https://openalex.org/W2164197909","https://openalex.org/W2282288858","https://openalex.org/W2337240321","https://openalex.org/W2513234781","https://openalex.org/W2586047314"],"related_works":["https://openalex.org/W2896552769","https://openalex.org/W3176921087","https://openalex.org/W7154726649","https://openalex.org/W2621438471","https://openalex.org/W4407355824","https://openalex.org/W4313855747","https://openalex.org/W3166231268","https://openalex.org/W2730363704","https://openalex.org/W4386057539","https://openalex.org/W2958065528"],"abstract_inverted_index":{"Detecting":[0],"dense":[1,30],"subgraphs":[2,31],"from":[3,14],"large":[4],"graphs":[5],"is":[6,38],"a":[7,33,53,74,122,128],"core":[8],"component":[9],"in":[10,32,93,201],"many":[11,100],"applications,":[12],"ranging":[13],"social":[15],"networks":[16],"mining,":[17],"bioinformatics,":[18],"to":[19,114],"online":[20],"fraud":[21,44,94,202],"detection.":[22,95,203],"In":[23],"this":[24],"paper,":[25],"we":[26],"focus":[27],"on":[28,179],"mining":[29,52],"bipartite":[34,54],"graph.":[35],"The":[36],"work":[37],"motivated":[39],"by":[40,57],"the":[41,58,88,106,117,138,145,166,195,199],"task":[42],"of":[43,198],"detection":[45],"that":[46,87,111,136,144,186],"can":[47,158],"often":[48],"be":[49,115],"formulated":[50],"as":[51,105],"graph":[55],"formed":[56],"source":[59],"nodes":[60,65],"(followers,":[61],"customers)":[62],"and":[63,85,132,152,161,182],"target":[64],"(followees,":[66],"products,":[67],"etc.)":[68],"for":[69,168],"malicious":[70],"patterns.":[71],"We":[72,96,126,141],"introduce":[73],"new":[75,196],"restricted":[76],"biclique":[77,102,109],"problem,":[78],"Maximal":[79],"Half":[80],"Isolated":[81],"Biclique":[82,119],"(MHI":[83],"Biclique),":[84],"show":[86],"problem":[89,110,120,139],"finds":[90],"immediate":[91],"applications":[92],"prove":[97],"that,":[98],"unlike":[99],"other":[101,153],"problems":[103],"such":[104],"maximum":[107],"edge":[108],"are":[112,147],"known":[113],"NP-Complete,":[116],"MHI":[118],"admits":[121],"linear":[123],"time":[124],"solution.":[125],"provide":[127],"novel":[129],"algorithm":[130],"S-tree,":[131],"its":[133],"extension,":[134],"S-forest,":[135],"solves":[137],"efficiently.":[140],"also":[142],"demonstrate":[143,185],"algorithms":[146],"robust":[148],"against":[149,174],"deliberate":[150],"camouflaging":[151],"perturbations.":[154],"Furthermore,":[155],"our":[156],"approach":[157],"automatically":[159],"combine":[160],"prioritize":[162],"multiple":[163],"features,":[164],"reducing":[165],"need":[167],"feature":[169],"engineering":[170],"while":[171],"maintaining":[172],"security":[173],"unseen":[175],"attacks.":[176],"Extensive":[177],"experiments":[178],"several":[180],"public":[181],"proprietary":[183],"datasets":[184],"S-tree/S-forest":[187],"outperforms":[188],"strong":[189],"rivals":[190],"across":[191],"all":[192],"configurations,":[193],"becoming":[194],"state":[197],"art":[200]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2018-10-26T00:00:00"}