Multi-Assignment Clustering for Boolean Data

author:Mario Frank, Department of Computer Science, ETH Zurich
published: Aug. 26, 2009,   recorded: June 2009,   views: 68
Categories
You might be experiencing some problems with Your Video player.

Related content

Visitors who watched this lecture also watched...
22:15
Boosting with Structural Sparsity

45 views - John Duchi, 2009
15:25
Graph Signature: A Simple Approach for Clustering Similar Graph

269 views - Rashid Jalal Qureshi, 2007
25:02
Evaluation Methods for Topic Models

96 views - Hanna M. Wallach, 2009
18:40
Frequent graph mining - what is the question?

205 views - Tamás Horváth, 2007
42:42
Data Clustering: 50 Years Beyond K-means

936 views - Anil K. Jain, 2008
33:31
Nonparametric Functional Data Analysis

209 views - Sonia Petrone, 2008
01:24:49
Bayesian Learning

3277 views - Zoubin Ghahramani, 1970
02:23:20
Data Mining for Anomaly Detection

1216 views - Arindam Banerjee, Aleksandar Lazarevic, Jaideep Srivastava, Vipin Kumar, Varun Chandola, 2008
03:21
K-nearest neighbor classification

4046 views - Antal van den Bosch, 2007
19:35
Support Cluster Machine

519 views - Bin Li, 2007

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.

Description

Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, we propose a generative method for clustering vectorial data, where each object can be assigned to multiple clusters. Using a deterministic annealing scheme, our method decomposes the observed data into the contributions of individual clusters and infers their parameters.
Experiments on synthetic Boolean data show that our method achieves higher accuracy in the source parameter estimation and superior cluster stability compared to state-of-the-art approaches. We also apply our method to an important problem in computer security known as role mining. Experiments on real-world access control data show performance gains in generalization to new employees against other multi-assignment methods. In challenging situations with high noise levels, our approach maintains its good performance, while alternative state-of-the-art techniques lack robustness.

Link this page  

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: