BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv4.6.25//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:http://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VEVENT
DTSTART;TZID=UTC+1:20180618T140000
DTEND;TZID=UTC+1:20180618T151500
DTSTAMP:20181116T100307
CREATED:20180608T115619Z
LAST-MODIFIED:20180612T072810Z
UID:9253-1529330400-1529334900@crest.science
SUMMARY:Mihai Cucuringu (Oxford University) - "Laplacian-based methods for ranking and constrained clustering"
DESCRIPTION:\nThe Statistical Seminar: Every Monday at 2:00 pm. \nTime: 2:00 pm – 3:15 pm\nDate: 18th of June 2018\nPlace: Room 3001. \nMihai Cucuringu (Oxford University) – “Laplacian-based methods for ranking and constrained clustering“ \nAbstract : We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g.\, ranking teams in sports data)\, computer vision\, and machine learning. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations\, whose usefulness has been demonstrated in numerous applications in recent years. Its least squares solution can be approximated by either a spectral or a semidefinite programming relaxation\, followed by a rounding procedure. We perform extensive numerical simulations on both synthetic and real-world data sets\, showing that our proposed method compares favorably to other algorithms from the recent literature. We also briefly discuss ongoing work on extensions and applications of the group synchronization framework to k-way synchronization\, list synchronization\, synchronization with heterogeneous information and partial rankings\, and phase unwrapping. \nWe also present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters\, at least for the case of 2-way partitioning\, via a generalized Cheeger inequality. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality. \nOrganizers:\nCristina BUTUCEA\, Alexandre TSYBAKOV\, Eric MOULINES\, Mathieu ROSENBAUM \nSponsors:\nCREST-CMAP \n \n\n
URL:http://crest.science/event/jamal-najim-cnrs-upem-tba-2-2-3-5-2-2
CATEGORIES:Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR