Graph clustering
SE Schaeffer - Computer science review, 2007 - Elsevier
In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …
Dynamic programming and graph algorithms in computer vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of
areas, and has been successfully applied to many vision problems. Discrete optimization …
areas, and has been successfully applied to many vision problems. Discrete optimization …
Fairness through awareness
We study fairness in classification, where individuals are classified, eg, admitted to a
university, and the goal is to prevent discrimination against individuals based on their …
university, and the goal is to prevent discrimination against individuals based on their …
Collective classification in network data
Many real-world applications produce networked data such as the world-wide web
(hypertext documents connected via hyperlinks), social networks (for example, people …
(hypertext documents connected via hyperlinks), social networks (for example, people …
Opinion mining and sentiment analysis
An important part of our information-gathering behavior has always been to find out what
other people think. With the growing availability and popularity of opinion-rich resources …
other people think. With the growing availability and popularity of opinion-rich resources …
Fast approximate energy minimization via graph cuts
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A
common constraint is that the labels should vary smoothly almost everywhere while …
common constraint is that the labels should vary smoothly almost everywhere while …
Semi-Supervised Learning (Chapelle, O. et al., Eds.; 2006) [Book reviews]
This book addresses some theoretical aspects of semisupervised learning (SSL). The book
is organized as a collection of different contributions of authors who are experts on this topic …
is organized as a collection of different contributions of authors who are experts on this topic …
Graphical models, exponential families, and variational inference
The formalism of probabilistic graphical models provides a unifying framework for capturing
complex dependencies among random variables, and building large-scale multivariate …
complex dependencies among random variables, and building large-scale multivariate …
Hinge-loss markov random fields and probabilistic soft logic
A fundamental challenge in develo** high-impact machine learning technologies is
balancing the need to model rich, structured domains with the ability to scale to big data …
balancing the need to model rich, structured domains with the ability to scale to big data …
Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales
We address the rating-inference problem, wherein rather than simply decide whether a
review is" thumbs up" or" thumbs down", as in previous sentiment analysis work, one must …
review is" thumbs up" or" thumbs down", as in previous sentiment analysis work, one must …