Sorry, you need to enable JavaScript to visit this website.

Graphical and kernel methods (MLR-GRKN)

Active Sampling for Graph-Aware Classification

Paper Details

Authors:
Dimitris Berberidis, Georgios B. Giannakis
Submitted On:
11 November 2017 - 5:35pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster_globalsip2017.pdf

(10 downloads)

Keywords

Subscribe

[1] Dimitris Berberidis, Georgios B. Giannakis, "Active Sampling for Graph-Aware Classification", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/2308. Accessed: Nov. 25, 2017.
@article{2308-17,
url = {http://sigport.org/2308},
author = {Dimitris Berberidis; Georgios B. Giannakis },
publisher = {IEEE SigPort},
title = {Active Sampling for Graph-Aware Classification},
year = {2017} }
TY - EJOUR
T1 - Active Sampling for Graph-Aware Classification
AU - Dimitris Berberidis; Georgios B. Giannakis
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/2308
ER -
Dimitris Berberidis, Georgios B. Giannakis. (2017). Active Sampling for Graph-Aware Classification. IEEE SigPort. http://sigport.org/2308
Dimitris Berberidis, Georgios B. Giannakis, 2017. Active Sampling for Graph-Aware Classification. Available at: http://sigport.org/2308.
Dimitris Berberidis, Georgios B. Giannakis. (2017). "Active Sampling for Graph-Aware Classification." Web.
1. Dimitris Berberidis, Georgios B. Giannakis. Active Sampling for Graph-Aware Classification [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/2308

Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models

Paper Details

Authors:
Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and
Submitted On:
10 November 2017 - 2:16pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:

Document Files

Globalsip17_JianDu_CMU.pdf

(4 downloads)

Keywords

Subscribe

[1] Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and , "Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/2298. Accessed: Nov. 25, 2017.
@article{2298-17,
url = {http://sigport.org/2298},
author = {Jian Du; Shaodan Ma; Yik-Chung Wu; Soummya Kar; and },
publisher = {IEEE SigPort},
title = {Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models},
year = {2017} }
TY - EJOUR
T1 - Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models
AU - Jian Du; Shaodan Ma; Yik-Chung Wu; Soummya Kar; and
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/2298
ER -
Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and . (2017). Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models. IEEE SigPort. http://sigport.org/2298
Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and , 2017. Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models. Available at: http://sigport.org/2298.
Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and . (2017). "Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models." Web.
1. Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, and . Convergence Analysis of Belief Propagation for Pairwise Linear Gaussian Models [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/2298

GlobalSip_2017


Consider a social network where only a few nodes (agents)
have meaningful interactions in the sense that the conditional
dependency graph over node attribute variables (behaviors)
is sparse. A company that can only observe the interactions
between its own customers will generally not be able to ac-
curately estimate its customers’ dependency subgraph: it is
blinded to any external interactions of its customers and this
blindness creates false edges in its subgraph. In this paper
we address the semiblind scenario where the company has

Paper Details

Authors:
Tianpei Xie, Sijia Liu, Alfred O. Hero III
Submitted On:
9 November 2017 - 11:30am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

globalsip17_slides.pdf

(6 downloads)

Keywords

Subscribe

[1] Tianpei Xie, Sijia Liu, Alfred O. Hero III, "GlobalSip_2017", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/2267. Accessed: Nov. 25, 2017.
@article{2267-17,
url = {http://sigport.org/2267},
author = {Tianpei Xie; Sijia Liu; Alfred O. Hero III },
publisher = {IEEE SigPort},
title = {GlobalSip_2017},
year = {2017} }
TY - EJOUR
T1 - GlobalSip_2017
AU - Tianpei Xie; Sijia Liu; Alfred O. Hero III
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/2267
ER -
Tianpei Xie, Sijia Liu, Alfred O. Hero III. (2017). GlobalSip_2017. IEEE SigPort. http://sigport.org/2267
Tianpei Xie, Sijia Liu, Alfred O. Hero III, 2017. GlobalSip_2017. Available at: http://sigport.org/2267.
Tianpei Xie, Sijia Liu, Alfred O. Hero III. (2017). "GlobalSip_2017." Web.
1. Tianpei Xie, Sijia Liu, Alfred O. Hero III. GlobalSip_2017 [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/2267

Semi-supervised learning in the presence of novel class instances

Paper Details

Authors:
Anh T. Pham, Raviv Raich, Xiaoli Z. Fern
Submitted On:
19 March 2016 - 8:25pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

Poster_ICASSP.pdf

(204 downloads)

Keywords

Subscribe

[1] Anh T. Pham, Raviv Raich, Xiaoli Z. Fern, "Semi-supervised learning in the presence of novel class instances", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/838. Accessed: Nov. 25, 2017.
@article{838-16,
url = {http://sigport.org/838},
author = {Anh T. Pham; Raviv Raich; Xiaoli Z. Fern },
publisher = {IEEE SigPort},
title = {Semi-supervised learning in the presence of novel class instances},
year = {2016} }
TY - EJOUR
T1 - Semi-supervised learning in the presence of novel class instances
AU - Anh T. Pham; Raviv Raich; Xiaoli Z. Fern
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/838
ER -
Anh T. Pham, Raviv Raich, Xiaoli Z. Fern. (2016). Semi-supervised learning in the presence of novel class instances. IEEE SigPort. http://sigport.org/838
Anh T. Pham, Raviv Raich, Xiaoli Z. Fern, 2016. Semi-supervised learning in the presence of novel class instances. Available at: http://sigport.org/838.
Anh T. Pham, Raviv Raich, Xiaoli Z. Fern. (2016). "Semi-supervised learning in the presence of novel class instances." Web.
1. Anh T. Pham, Raviv Raich, Xiaoli Z. Fern. Semi-supervised learning in the presence of novel class instances [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/838

Models for Spectral Clustering and Their Applications


Microarray Spectral Clustering.

Ph.D. Thesis by Donald McCuan (advisor Andrew Knyazev), Department of Mathematical and Statistical Sciences, University of Colorado Denver, 2012, originally posted at http://math.ucdenver.edu/theses/McCuan_PhdThesis.pdf (524 downloads)

Paper Details

Authors:
Donald Donald
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Document Year:
Cite

Document Files

McCuan_PhdThesis.pdf

(524 downloads)

Keywords

Subscribe

[1] Donald Donald, "Models for Spectral Clustering and Their Applications", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/564. Accessed: Nov. 25, 2017.
@article{564-15,
url = {http://sigport.org/564},
author = {Donald Donald },
publisher = {IEEE SigPort},
title = {Models for Spectral Clustering and Their Applications},
year = {2015} }
TY - EJOUR
T1 - Models for Spectral Clustering and Their Applications
AU - Donald Donald
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/564
ER -
Donald Donald. (2015). Models for Spectral Clustering and Their Applications. IEEE SigPort. http://sigport.org/564
Donald Donald, 2015. Models for Spectral Clustering and Their Applications. Available at: http://sigport.org/564.
Donald Donald. (2015). "Models for Spectral Clustering and Their Applications." Web.
1. Donald Donald. Models for Spectral Clustering and Their Applications [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/564

Multigrid Eigensolvers for Image Segmentation


Spectral Image Segmentation

Presentation at LANL and UC Davis, 2009. Originally posted at http://math.ucdenver.edu/~aknyazev/research/conf/

LANL09.ppt

Office presentation icon LANL09.ppt (290 downloads)

Paper Details

Authors:
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Document Year:
Cite

Document Files

LANL09.ppt

(290 downloads)

Keywords

Subscribe

[1] , "Multigrid Eigensolvers for Image Segmentation", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/562. Accessed: Nov. 25, 2017.
@article{562-15,
url = {http://sigport.org/562},
author = { },
publisher = {IEEE SigPort},
title = {Multigrid Eigensolvers for Image Segmentation},
year = {2015} }
TY - EJOUR
T1 - Multigrid Eigensolvers for Image Segmentation
AU -
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/562
ER -
. (2015). Multigrid Eigensolvers for Image Segmentation. IEEE SigPort. http://sigport.org/562
, 2015. Multigrid Eigensolvers for Image Segmentation. Available at: http://sigport.org/562.
. (2015). "Multigrid Eigensolvers for Image Segmentation." Web.
1. . Multigrid Eigensolvers for Image Segmentation [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/562

Novel data clustering for microarrays and image segmentation


Spectral Clustering Eigenvalue Problem

We develop novel algorithms and software on parallel computers for data clustering of large datasets. We are interested in applying our approach, e.g., for analysis of large datasets of microarrays or tiling arrays in molecular biology and for segmentation of high resolution images.

Paper Details

Authors:
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Document Year:
Cite

Document Files

camready-1031.ppt

(283 downloads)

Keywords

Subscribe

[1] , "Novel data clustering for microarrays and image segmentation", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/561. Accessed: Nov. 25, 2017.
@article{561-15,
url = {http://sigport.org/561},
author = { },
publisher = {IEEE SigPort},
title = {Novel data clustering for microarrays and image segmentation},
year = {2015} }
TY - EJOUR
T1 - Novel data clustering for microarrays and image segmentation
AU -
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/561
ER -
. (2015). Novel data clustering for microarrays and image segmentation. IEEE SigPort. http://sigport.org/561
, 2015. Novel data clustering for microarrays and image segmentation. Available at: http://sigport.org/561.
. (2015). "Novel data clustering for microarrays and image segmentation." Web.
1. . Novel data clustering for microarrays and image segmentation [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/561

Edge-enhancing filters with negative weights


Edge-enhanced eigenvectors of the Laplacian with a negative weight

In [doi{10.1109/ICMEW.2014.6890711}], a~graph-based filtering of noisy images is performed by directly computing a projection of the image to be filtered onto a lower dimensional Krylov subspace of the graph Laplacian, constructed using non-negative graph weights determined by distances between image data corresponding to image pixels. We extend the construction of the graph Laplacian to the case, where some graph weights can be negative.

KGlobalSIP.pdf

PDF icon KGlobalSIP.pdf (302 downloads)

Paper Details

Authors:
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

KGlobalSIP.pdf

(302 downloads)

Keywords

Subscribe

[1] , "Edge-enhancing filters with negative weights", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/503. Accessed: Nov. 25, 2017.
@article{503-15,
url = {http://sigport.org/503},
author = { },
publisher = {IEEE SigPort},
title = {Edge-enhancing filters with negative weights},
year = {2015} }
TY - EJOUR
T1 - Edge-enhancing filters with negative weights
AU -
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/503
ER -
. (2015). Edge-enhancing filters with negative weights. IEEE SigPort. http://sigport.org/503
, 2015. Edge-enhancing filters with negative weights. Available at: http://sigport.org/503.
. (2015). "Edge-enhancing filters with negative weights." Web.
1. . Edge-enhancing filters with negative weights [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/503

Kernel-based low-rank feature extraction on a budget for Big data streams

Paper Details

Authors:
Dimitrios Berberidis, Georgios B. Giannakis
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

Globalsip2015.pdf

(581 downloads)

Keywords

Subscribe

[1] Dimitrios Berberidis, Georgios B. Giannakis, "Kernel-based low-rank feature extraction on a budget for Big data streams", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/434. Accessed: Nov. 25, 2017.
@article{434-15,
url = {http://sigport.org/434},
author = {Dimitrios Berberidis; Georgios B. Giannakis },
publisher = {IEEE SigPort},
title = {Kernel-based low-rank feature extraction on a budget for Big data streams},
year = {2015} }
TY - EJOUR
T1 - Kernel-based low-rank feature extraction on a budget for Big data streams
AU - Dimitrios Berberidis; Georgios B. Giannakis
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/434
ER -
Dimitrios Berberidis, Georgios B. Giannakis. (2015). Kernel-based low-rank feature extraction on a budget for Big data streams. IEEE SigPort. http://sigport.org/434
Dimitrios Berberidis, Georgios B. Giannakis, 2015. Kernel-based low-rank feature extraction on a budget for Big data streams. Available at: http://sigport.org/434.
Dimitrios Berberidis, Georgios B. Giannakis. (2015). "Kernel-based low-rank feature extraction on a budget for Big data streams." Web.
1. Dimitrios Berberidis, Georgios B. Giannakis. Kernel-based low-rank feature extraction on a budget for Big data streams [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/434

Accelerated graph-based spectral polynomial filters


BF, GF and CG filters on 1D signals

Graph-based spectral denoising is a low-pass filtering using the eigendecomposition of the graph Laplacian matrix of a noisy signal. Polynomial filtering avoids costly computation of the eigendecomposition by projections onto suitable Krylov subspaces. Polynomial filters can be based, e.g., on the bilateral and guided filters. We propose constructing accelerated polynomial filters by running flexible Krylov subspace based linear and eigenvalue solvers such as the Block Locally Optimal Preconditioned Conjugate Gradient (LOBPCG) method.

MLSP2015.pdf

PDF icon MLSP2015.pdf (331 downloads)

Paper Details

Authors:
Alexander Malyshev
Submitted On:
23 February 2016 - 1:44pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

MLSP2015.pdf

(331 downloads)

Keywords

Subscribe

[1] Alexander Malyshev, "Accelerated graph-based spectral polynomial filters", IEEE SigPort, 2015. [Online]. Available: http://sigport.org/297. Accessed: Nov. 25, 2017.
@article{297-15,
url = {http://sigport.org/297},
author = {Alexander Malyshev },
publisher = {IEEE SigPort},
title = {Accelerated graph-based spectral polynomial filters},
year = {2015} }
TY - EJOUR
T1 - Accelerated graph-based spectral polynomial filters
AU - Alexander Malyshev
PY - 2015
PB - IEEE SigPort
UR - http://sigport.org/297
ER -
Alexander Malyshev. (2015). Accelerated graph-based spectral polynomial filters. IEEE SigPort. http://sigport.org/297
Alexander Malyshev, 2015. Accelerated graph-based spectral polynomial filters. Available at: http://sigport.org/297.
Alexander Malyshev. (2015). "Accelerated graph-based spectral polynomial filters." Web.
1. Alexander Malyshev. Accelerated graph-based spectral polynomial filters [Internet]. IEEE SigPort; 2015. Available from : http://sigport.org/297