Rank: 1675 based on 35 downloads (last 30 days) and 2 files submitted
photo

Yohai Devir

E-mail

Personal Profile:

MSc student in the CS department of the Technion IIT

Professional Interests:
Image processing, Projective clustering

 

Watch this Author's files

 

Files Posted by Yohai View all
  • 1 - 2 of
  • 2
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
25 Feb 2008 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir mincut, graph, min, cut, mathematics 22 3
  • 4.0
4.0 | 3 ratings
19 Dec 2006 k-Means Projective Clustering Perform projective clusterig Author: Yohai Devir statistics, clustering, kmeans, projective clustering, probability 13 1
  • 5.0
5.0 | 1 rating
Comments and Ratings by Yohai
  • 1 - 1 of
  • 1
Updated File Comments Rating
15 Mar 2011 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir

Here's a usage example:

Consider the graph appearing at
http://upload.wikimedia.org/wikipedia/commons/4/45/Dijksta_Anim.gif

The weights matrix is
W = [Inf,7,9,Inf,Inf,14;7,Inf,10,15,Inf,Inf;9,10,Inf,11,Inf,2;Inf,15,11,Inf,6,Inf;Inf,Inf,Inf,6,Inf,9;14,Inf,2,Inf,9,Inf;];

If we want to find the minimal cut such that vertices 1 and 5 are on the same side of the graph:
[MinCutGroupsList, MinCutWeight] = MinCut([1 5], W)

MinCutGroupsList =

     2 3 4 0 0 0
     1 5 6 0 0 0

MinCutWeight = 24

meaning that:
- Vertices 2,3,4 are on one side of the cut
- Vertices 1,5,6 are on the other side.
- The sum of weights along the cut is 24.

A few farther notes:
- Zero entries for a missing edges also works.
- The weights matrix must be symmetric. Directed edges are not supported.
Comments and Ratings on Yohai's Files View all
  • 1 - 5 of
  • 5
Updated File Comment by Comments Rating
15 Mar 2011 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir Devir, Yohai

Here's a usage example:

Consider the graph appearing at
http://upload.wikimedia.org/wikipedia/commons/4/45/Dijksta_Anim.gif

The weights matrix is
W = [Inf,7,9,Inf,Inf,14;7,Inf,10,15,Inf,Inf;9,10,Inf,11,Inf,2;Inf,15,11,Inf,6,Inf;Inf,Inf,Inf,6,Inf,9;14,Inf,2,Inf,9,Inf;];

If we want to find the minimal cut such that vertices 1 and 5 are on the same side of the graph:
[MinCutGroupsList, MinCutWeight] = MinCut([1 5], W)

MinCutGroupsList =

     2 3 4 0 0 0
     1 5 6 0 0 0

MinCutWeight = 24

meaning that:
- Vertices 2,3,4 are on one side of the cut
- Vertices 1,5,6 are on the other side.
- The sum of weights along the cut is 24.

A few farther notes:
- Zero entries for a missing edges also works.
- The weights matrix must be symmetric. Directed edges are not supported.
17 Aug 2010 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir Shlosberg, Roie

אתה יכול לתת דוגמא בבקשה לקלט ופלט?
17 Feb 2010 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir Fei, Tai

could you please give some examples, then it is easy to understand the input of your code.... thx
02 May 2009 k-Means Projective Clustering Perform projective clusterig Author: Yohai Devir Criton, Gilles

Yohai Devir provided a very useful subspace clustering algorithm. Especially because it is rare to find in matlab a such code.
The code is really clear, and works very well.

Thank you Yohai.
 
12 Jun 2008 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir Carvalho, Sara
Top Tags Applied by Yohai
  • 1 - 5 of
  • 10
clustering, cut, graph, kmeans, mathematics
Files Tagged by Yohai View all
  • 1 - 2 of
  • 2
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
25 Feb 2008 A simple min cut algorithm Find a minimal cut in a graph keeping a set of vertices together Author: Yohai Devir mincut, graph, min, cut, mathematics 22 3
  • 4.0
4.0 | 3 ratings
19 Dec 2006 k-Means Projective Clustering Perform projective clusterig Author: Yohai Devir statistics, clustering, kmeans, projective clustering, probability 13 1
  • 5.0
5.0 | 1 rating

Contact us at files@mathworks.com