LISTSERV mailing list manager LISTSERV 16.5

Help for MATHTALK Archives


MATHTALK Archives

MATHTALK Archives


MATHTALK@LISTSERV.UTK.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

MATHTALK Home

MATHTALK Home

MATHTALK  November 2023

MATHTALK November 2023

Subject:

Reminder: Data Science and Statistics Seminar [Ayres 111, Thursday 11/9 @4:30PM]

From:

"Maroulas, Vasileios" <[log in to unmask]>

Reply-To:

Maroulas, Vasileios

Date:

Thu, 9 Nov 2023 13:29:50 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (26 lines)

Dear All,

I cordially invite you to the Data Science and Statistics Seminar in Math Dept (Ayres 111), today Thursday 11/9 @4:30PM. 
Our speaker will be Dr. Tomojit Ghosh from UT Chattanooga who will introduce an autoencoder based on a supervised approach for data viz. The auto encoder relies on a pertinent sparse optimization, and will be applied on biological data sets. 

For more information, please see below. 

Thank you and I am looking forward to seeing you today at 4:30PM. 

Vasileios Maroulas




Speaker: Tomojit Ghosh

Affiliation: University of Tennessee Chattanooga 

Title: Some Convex and Nonconvex Models to Analyze Biological Data Sets.

Abstract: Classification, visualization, and feature selection are three essential tasks of machine learning. This talk presents convex and non-convex models suitable for these three tasks, especially for high-dimensional biological data sets. We introduce Centroid-Encoder (CE), an autoencoder-based supervised data visualization tool. We further developed a sparse optimization problem for the non-linear mapping of the centroid-encoder, Sparse Centroid-Encoder (SCE), to determine the set of discriminative features between two or more classes. CE and SCE are models based on neural network architectures and require the solution of non-convex optimization problems. Motivated by the CE algorithm, we present a linear formulation of the Centroid-Encoder with orthogonality constraints called Linear Centroid Encoder (LCE). This formulation is similar to PCA (Principal Component Analysis), except the class labels are used to formulate the objective, resulting in supervised PCA. Finally, we present a linear formulation of the Sparse Centroid-Encoder called Sparse Linear Centroid Encoder (SLCE), which employs a two-step training process where each step is convex. The author will show the application of these algorithms on biological data sets.
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

To leave the list go here:
https://listserv.utk.edu/cgi-bin/wa?SUBED1=MATHTALK&A=1

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
May 2021
April 2021
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018

ATOM RSS1 RSS2



LISTSERV.UTK.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager