"Discovering top-k non-redundant clusterings in attributed graphs."

Gustavo Paiva Guedes et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.NEUCOM.2015.10.145

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijon/GuedesOBX16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijon/GuedesOBX16
Gustavo Paiva Guedes, Eduardo S. Ogasawara, Eduardo Bezerra, Geraldo Xexéo:
Discovering top-k non-redundant clusterings in attributed graphs. Neurocomputing 210: 45-54 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.