Conference item
SPONGE: A generalized eigenproblem for clustering signed networks
- Abstract:
-
We introduce a principled and theoretically sound spectral method for k-way clustering in signed graphs, where the affinity measure between nodes takes either positive or negative values. Our approach is motivated by social balance theory, where the task of clustering aims to decompose the network into disjoint groups such that individuals within the same group are connected by as many positive edges as possible, while individuals from different groups are connected by as many negative edges ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 9.6MB)
-
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Proceedings of Machine Learning Research Publisher's website
- Journal:
- pmlr Journal website
- Volume:
- 89
- Pages:
- 1088-1098
- Host title:
- PMLR
- Publication date:
- 2019-04-25
- Acceptance date:
- 2018-12-22
- EISSN:
-
2640-3498
- Source identifiers:
-
959535
Item Description
- Pubs id:
-
pubs:959535
- UUID:
-
uuid:99c44cfd-ac20-4bb1-ab35-4304fa0bc80a
- Local pid:
- pubs:959535
- Deposit date:
- 2019-01-15
Terms of use
- Copyright holder:
- Cucuringu et al
- Copyright date:
- 2019
- Notes:
- © 2019 by the author(s). This paper has been presented at the 22nd International Conference on Artificial Intelligence and Statistics, 16-18 April 2019, Naha, Okinawa, Japan
If you are the owner of this record, you can report an update to it here: Report update to this record