A Dynamic Algorithm for Updating Katz Centrality in Graphs
Many large datasets from a variety of fields of research can be represented as graphs. A common query is to identify the most important, or highly ranked, vertices in a graph. Centrality metrics are used to obtain numerical scores for each vertex in the graph. The scores can then be translated to ra...
Uloženo v:
| Vydáno v: | Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 s. 149 - 154 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
31.07.2017
|
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 1450349935, 9781450349932 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Many large datasets from a variety of fields of research can be represented as graphs. A common query is to identify the most important, or highly ranked, vertices in a graph. Centrality metrics are used to obtain numerical scores for each vertex in the graph. The scores can then be translated to rankings identifying relative importance of vertices. In this work we focus on Katz Centrality, a linear algebra based metric. In many real applications, since data is constantly being produced and changed, it is necessary to have a dynamic algorithm to update centrality scores with minimal computation when the graph changes. We present an algorithm for updating Katz Centrality scores in a dynamic graph that incrementally updates the centrality scores as the underlying graph changes. Our proposed method exploits properties of iterative solvers to obtain updated Katz scores in dynamic graphs. Our dynamic algorithm improves performance and achieves speedups of over two orders of magnitude compared to a standard static algorithm while maintaining high quality of results. |
|---|---|
| AbstractList | Many large datasets from a variety of fields of research can be represented as graphs. A common query is to identify the most important, or highly ranked, vertices in a graph. Centrality metrics are used to obtain numerical scores for each vertex in the graph. The scores can then be translated to rankings identifying relative importance of vertices. In this work we focus on Katz Centrality, a linear algebra based metric. In many real applications, since data is constantly being produced and changed, it is necessary to have a dynamic algorithm to update centrality scores with minimal computation when the graph changes. We present an algorithm for updating Katz Centrality scores in a dynamic graph that incrementally updates the centrality scores as the underlying graph changes. Our proposed method exploits properties of iterative solvers to obtain updated Katz scores in dynamic graphs. Our dynamic algorithm improves performance and achieves speedups of over two orders of magnitude compared to a standard static algorithm while maintaining high quality of results. |
| Author | Nathan, Eisha Bader, David A. |
| Author_xml | – sequence: 1 givenname: Eisha surname: Nathan fullname: Nathan, Eisha email: enathan3@gatech.edu organization: School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, Georgia – sequence: 2 givenname: David A. surname: Bader fullname: Bader, David A. email: bader@cc.gatech.edu organization: School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, Georgia |
| BookMark | eNqNjztPwzAUhS0BErR0ZvXIkuBXEpstClAQlVjobPnZGhKnSryUX4-B_gCGe87VvUdH-hbgPI7RAXCDUYkxq-4oxgiRqvx1ys7AIl_zIgStLsFqnj9Q_mOeh16B-xY-HKMagoFtvxunkPYD9OMEtwerUog7-KrSF-xcTJPqQzrCEOF6Uof9fA0uvOpntzr5EmyfHt-752Lztn7p2k2hMCOpYKoWyGoqPEKNrrlxTc25UYx4YWvBGSENcRxRXGWpTEO50ry2GJnGWu3pEtz-9SozSD2On7PESP6wyhOrPLHmaPnPqNRTcJ5-A6OtVMo |
| ContentType | Conference Proceeding |
| Copyright | 2017 ACM |
| Copyright_xml | – notice: 2017 ACM |
| DOI | 10.1145/3110025.3110034 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| Editor | Diesner, Jana Ferrari, Elena Xu, Guandong |
| Editor_xml | – sequence: 1 givenname: Jana surname: Diesner fullname: Diesner, Jana – sequence: 2 givenname: Elena surname: Ferrari fullname: Ferrari, Elena – sequence: 3 givenname: Guandong surname: Xu fullname: Xu, Guandong |
| EndPage | 154 |
| GroupedDBID | 6IE 6IF 6IL 6IN AAWTH ABLEC ACM ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IEGSK LHSKQ OCL RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-a142t-4a690db39f007b68ce7688ca42f9d69842272e803158035c738ab86d10c7ddbf3 |
| ISBN | 1450349935 9781450349932 |
| IngestDate | Thu Jul 10 05:53:10 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | OpenURL |
| MeetingName | ASONAM '17: Advances in Social Networks Analysis and Mining 2017 |
| MergedId | FETCHMERGED-LOGICAL-a142t-4a690db39f007b68ce7688ca42f9d69842272e803158035c738ab86d10c7ddbf3 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_3110025_3110034 acm_books_10_1145_3110025_3110034_brief |
| PublicationCentury | 2000 |
| PublicationDate | 20170731 |
| PublicationDateYYYYMMDD | 2017-07-31 |
| PublicationDate_xml | – month: 07 year: 2017 text: 20170731 day: 31 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 ASONAM 2017 : proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining : Sydney, Australia, 31 July-03 August, 2017 |
| PublicationYear | 2017 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002180213 |
| Score | 1.7564825 |
| Snippet | Many large datasets from a variety of fields of research can be represented as graphs. A common query is to identify the most important, or highly ranked,... |
| SourceID | acm |
| SourceType | Publisher |
| StartPage | 149 |
| SubjectTerms | Applied computing Applied computing -- Physical sciences and engineering Applied computing -- Physical sciences and engineering -- Mathematics and statistics Computing methodologies Computing methodologies -- Symbolic and algebraic manipulation Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms Information systems Information systems -- Information systems applications Mathematics of computing Mathematics of computing -- Discrete mathematics Mathematics of computing -- Discrete mathematics -- Graph theory Mathematics of computing -- Discrete mathematics -- Graph theory -- Graph algorithms Mathematics of computing -- Probability and statistics Theory of computation Theory of computation -- Design and analysis of algorithms |
| Title | A Dynamic Algorithm for Updating Katz Centrality in Graphs |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBZN6KGnvlKavlCh0MPidCXLK6nQg0lfULLkkEBuRrasdiFxwtotob--M5JsbbeFtode5LXwykjfIM2MZ74h5AW6763D1C1r5hnSn2RaOZ0Z41hhJBw52vliE3K5VGdn-jiG2_a-nIDsOnV9ra_-K9TQB2Bj6uw_wD0NCh3wG0CHFmCHdksj_u3hczx19uP3f1gKOUOrDskTDo-2vIAp5w8_HJQhJsBHycbU3WWIFO8TgYkPzvCVJfzYm2JXzt6GGvez8vzz5Xo1fLnwkYynV5hHAX_4ZIbvo08ZLQB4zwckzZ50-6X35vs9GitDJ1erDdLlo_Bn5UHYD5GnuX-Ds0rz-MmVwSYf6SR8R8m6ZaJA6hydFxvbKwv0pvGkZoF--tdDQCBfRo5keLw48Ndc7JAdKechwW9ywnHkv_O1J9PrRh6weM8jHxR0vNoaEhWa5mJDHTm5Q_bSZGkC_C650Xb3yO2xUgeNG_d98rqkERY6wUIBFjrCQhEWmmChq44GWPbI6ft3J4cfs1g1IzNM8CETZqHnts61A_WvXqimBYtSNUZwp-1CK8G55K3C6h7QFI3MlanVwrJ5I62tXf6A7HaXXfuQUK3BnHU5aMVNIVjdKmGtc4pr0HlrwfQ-eQ4LUKHw91XIcC-quEhVXKR98vKPz1Q1yIp79BejPSa3kuA8IbvD-mv7lNxsvg2rfv3Mg_sDjrpYAQ |
| linkProvider | IEEE |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+2017+IEEE%2FACM+International+Conference+on+Advances+in+Social+Networks+Analysis+and+Mining+2017&rft.atitle=A+Dynamic+Algorithm+for+Updating+Katz+Centrality+in+Graphs&rft.au=Nathan%2C+Eisha&rft.au=Bader%2C+David+A.&rft.series=ACM+Conferences&rft.date=2017-07-31&rft.pub=ACM&rft.isbn=1450349935&rft.spage=149&rft.epage=154&rft_id=info:doi/10.1145%2F3110025.3110034 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349932/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349932/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349932/sc.gif&client=summon&freeimage=true |