BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20230413T095405Z
DTSTART:20230419T150000Z
DTEND:20230419T160000Z
SUMMARY:Mitchell Centre seminar
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}z1c5-lgey11
py-270v5p
DESCRIPTION:Jürgen Pfeffer \n\nTechnical University of Munich \n\nCONCOR
Revisited: Algebraic Clarifications and Practical Implications \n\nIn 19
75\, Breiger et al. presented an algorithm\, CONCOR (an acronym derived
from " convergence of iterated correlations")\, for bipartite partitioni
ng of network data. While most clustering algorithms aim to identify coh
esive subgroups of nodes that are more densely connected among themselve
s than to other nodes in the network\, the aim of the CONCOR algorithm i
s to obtain a partition of the vertices of the network graph into two bl
ocks\, in which the vertices in each block are considered to be structur
ally equivalent\, or at least structurally similar. CONCOR is very versa
tile and can be applied to multi-relational networks and can even incorp
orate network attributes into the clustering procedure. However\, the al
gorithm was criticized in the past for having opaque arithmetic properti
es. The major drawback of CONCOR can be summarized with Arabie & Schleut
ermann's (1990) observation that "CONCOR is a convenient algorithm which
happens to yield substantive results rather than a compelling model as
its mathematical properties are still not fully understood." The goal of
this paper is to create a better understanding of algebraic and algorit
hmic properties of the CONCOR algorithm and to offer new perspectives on
possible application scenarios.
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:G7\, Humanities Bridgeford Street\, Manchester
END:VEVENT
END:VCALENDAR