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 …

Dynamic programming and graph algorithms in computer vision

PF Felzenszwalb, R Zabih - IEEE transactions on pattern …, 2010 - ieeexplore.ieee.org
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 …

Fairness through awareness

C Dwork, M Hardt, T Pitassi, O Reingold… - Proceedings of the 3rd …, 2012 - dl.acm.org
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 …

Collective classification in network data

P Sen, G Namata, M Bilgic, L Getoor, B Galligher… - AI magazine, 2008 - ojs.aaai.org
Many real-world applications produce networked data such as the world-wide web
(hypertext documents connected via hyperlinks), social networks (for example, people …

Opinion mining and sentiment analysis

B Pang, L Lee - Foundations and Trends® in information …, 2008 - nowpublishers.com
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 …

Fast approximate energy minimization via graph cuts

Y Boykov, O Veksler, R Zabih - IEEE Transactions on pattern …, 2001 - ieeexplore.ieee.org
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 …

Semi-Supervised Learning (Chapelle, O. et al., Eds.; 2006) [Book reviews]

O Chapelle, B Scholkopf, A Zien - IEEE Transactions on Neural …, 2009 - ieeexplore.ieee.org
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 …

Graphical models, exponential families, and variational inference

MJ Wainwright, MI Jordan - Foundations and Trends® in …, 2008 - nowpublishers.com
The formalism of probabilistic graphical models provides a unifying framework for capturing
complex dependencies among random variables, and building large-scale multivariate …

Hinge-loss markov random fields and probabilistic soft logic

SH Bach, M Broecheler, B Huang, L Getoor - Journal of Machine Learning …, 2017 - jmlr.org
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 …

Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales

B Pang, L Lee - arxiv preprint cs/0506075, 2005 - arxiv.org
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 …