• DocumentCode
    3331070
  • Title

    Computing Cross Associations for Attack Graphs and Other Applications

  • Author

    Heydari, M.H. ; Morales, L. ; Shields, C.O. ; Sudborough, I.H.

  • Author_Institution
    Dept. of Comput. Sci., James Madison Univ., Harrisonburg, VA
  • fYear
    2007
  • fDate
    Jan. 2007
  • Abstract
    Applications in information security, data mining, e-commerce, information retrieval and network management require the analysis of large graphs in order to discover homogeneous groupings of rows and columns, called cross associations. We show that finding an optimal cross association is NP-complete. Furthermore, we give a heuristic algorithm with an O(n4) running time for finding good cross associations
  • Keywords
    computational complexity; graph theory; security of data; NP-complete problem; attack graphs; data mining; e-commerce; heuristic algorithm; information retrieval; information security; network management; optimal cross association finding; Application software; Bipartite graph; Business; Computer networks; Computer science; Data mining; Information analysis; Information retrieval; Information security; Information systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on
  • Conference_Location
    Waikoloa, HI
  • ISSN
    1530-1605
  • Electronic_ISBN
    1530-1605
  • Type

    conf

  • DOI
    10.1109/HICSS.2007.141
  • Filename
    4076929
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3331070