DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Yi, Yung | - |
dc.contributor.advisor | 이융 | - |
dc.contributor.author | Gutierrez, Gwenevere Kay | - |
dc.date.accessioned | 2021-05-13T19:39:43Z | - |
dc.date.available | 2021-05-13T19:39:43Z | - |
dc.date.issued | 2020 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=925241&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/285077 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2020.8,[iv, 24 p. :] | - |
dc.description.abstract | Tensor decomposition methods have been widely used to represent a tensor into a compact representation of vectors or set of vectors. These representations should be able to reproduce the original input. Poison attacks occur when we change the input tensor data therefore negatively affecting the performance of succeeding tasks such as classification. In order to investigate how different tensor decomposition algorithms are vulnerable to attacks, we propose two methods of flipping the binary input tensors, namely random attack method and minimum difference method. Simulations show that applying minimum difference attack incurs greater reconstruction error than random attack. We also show that Alternating Poisson Regression algorithm is more vulnerable than Alternating Least Squares Algorithm when minimum difference attack is applied in terms of classifying movie genres. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Tensor Decomposition▼aCP APR Algorithm▼aCP ALS Algorithm▼aBinary Tensors | - |
dc.subject | 텐서 분해▼aCP APR 알고리즘▼aCP ALS 알고리즘▼a이진 텐서 | - |
dc.title | Study on poisoning attacks on CANDECOMP/PARAFAC tensor decomposition for binary tensors | - |
dc.title.alternative | 이진 텐서용 CANDECOMP/PARAFAC 텐서 분해에 대한 포이즈닝 공격에 대한 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 구체레스 그웨네비에 캐이 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.