제목
통계학과 세미나 공고
작성자
조승규
작성일
2016-02-05
조회수
1002
첨부파일
파일 다운로드 _talkf_oWyYHgD8vs_RCELK1pkQn7AgfId05Wjx1_f_km3q7v.hwp | 크기 : 37,376 byte | 다운 : 90

통계학과 세미나 공고

 

▣ 세미나 1

√ 일 시 :

2016년 2월 12일 (금) 오후 3:30 ~ 4:20

√ 발표자 :

Kwok L. Tsui (Systems Engineering & Engineering Management, City University of Hong Kong)

√ 장 소 :

중앙대학교 법학관 303동 703호 첨단강의실

√ 주 제 :

Evolution of Big Data Analytics

 

▣ 세미나 2

√ 일 시 :

2016년 2월 12일 (금) 오후 4:40 ~ 5:30

√ 발표자 :

Joong-Ho Won (Department of Statistics, Seoul National University)

√ 장 소 :

중앙대학교 법학관 303동 703호 첨단강의실

√ 주 제 :

Computational Approaches in Data Mining and Portfolio Selection

 

 

Abstract

 

 

[세미나 1]

 

Due to the advancement of computation power and data storage/collection technologies, the field of data modelling and applications have been evolving rapidly over the last two decades, with different buzz words as knowledge discovery in databases (KDD), data mining (DM), business analytics, big data analytic, ... . There are tremendous opportunities in interdisciplinary research and education in data science, system informatics, and big data analytics; as well as in complex systems optimization and management in various industries of finance, healthcare, transportation, and energy, etc. In this talk we will present our views and experience in the evolution of big data analytics, challenges and opportunities, as well as applications in various industries.

 

[세미나 2]

 

This talk consists of two parts. In the first part, I will share my experience with the use of high-performance computing (HPC) in high-dimensional data mining problems, which are well known to be difficult both theoretically and computationally. I advocate parallelization as a practical solution to mitigate the computational difficulties, and show that a fair amount of parallelism can be achieved with small efforts by using commodity HPC systems. Success and failure stories of adopting graphics processing units (GPUs) for the fused lasso sparse regression and Hadoop MapReduce for graph algorithms are discussed. In the second part, I will discuss a use of numerical optimization in financial portfolio selection problems in the presence of parameter uncertainty. Robust optimization is employed to explicitly incorporate a model of parameter uncertainty in the problem formulation, and optimizes for the worst-case scenario. This part of the talk considers robust mean-variance portfolio selection involving a trade-off between the worst-case utility and the worst-case regret, or the largest difference between the best utility achievable under the model and that achieved by a given portfolio. I will show that while optimizing for the worst-case utility may yield an overly pessimistic portfolio, optimizing for the worst-case regret may result in a complete loss of robustness. Robust trade-off portfolio compromises these two extremes, enabling more informative selections. I will show that, under a widely used ellipsoidal uncertainty model, the entire optimal trade-off curve can be found via solving a series of semidefinite programs (SDPs), which are computationally tractable. I then extend the model to handle a union of finitely many ellipsoids, and show that trade-off analysis under this quite general uncertainty model also reduces to a series of SDPs. For more general uncertainties, I propose an iterative algorithm based on the cutting-set method.

 

Department of Statistics &

The Research Center for Data Science

목록