dc.contributor.author | Wang, Xiulin | |
dc.contributor.author | Zhang, Chi | |
dc.contributor.author | Ristaniemi, Tapani | |
dc.contributor.author | Cong, Fengyu | |
dc.contributor.editor | Lu, Huchuan | |
dc.contributor.editor | Tang, Huajin | |
dc.contributor.editor | Wang, Zhanshan | |
dc.date.accessioned | 2019-07-03T04:57:17Z | |
dc.date.available | 2019-07-03T04:57:17Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Wang, X., Zhang, C., Ristaniemi, T., & Cong, F. (2019). Generalization of Linked Canonical Polyadic Tensor Decomposition for Group Analysis. In H. Lu, H. Tang, & Z. Wang (Eds.), <i>ISNN 2019 : Advances in Neural Networks : 16th International Symposium on Neural Networks, Proceedings, Part II</i> (pp. 180-189). Springer International Publishing. Lecture Notes in Computer Science, 11555. <a href="https://doi.org/10.1007/978-3-030-22808-8_19" target="_blank">https://doi.org/10.1007/978-3-030-22808-8_19</a> | |
dc.identifier.other | CONVID_31253760 | |
dc.identifier.other | TUTKAID_81824 | |
dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/64969 | |
dc.description.abstract | Real-world data are often linked with each other since they share some common characteristics. The mutual linking can be seen as a core driving force of group analysis. This study proposes a generalized linked canonical polyadic tensor decomposition (GLCPTD) model that is well suited to exploiting the linking nature in multi-block tensor analysis. To address GLCPTD model, an efficient algorithm based on hierarchical alternating least squa res (HALS) method is proposed, termed as GLCPTD-HALS algorithm. The proposed algorithm enables the simultaneous extraction of common components, individual components and core tensors from tensor blocks. Simulation experiments of synthetic EEG data analysis and image reconstruction and denoising were conducted to demonstrate the superior performance of the proposed generalized model and its realization. | fi |
dc.format.extent | 615 | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.publisher | Springer International Publishing | |
dc.relation.ispartof | ISNN 2019 : Advances in Neural Networks : 16th International Symposium on Neural Networks, Proceedings, Part II | |
dc.relation.ispartofseries | Lecture Notes in Computer Science | |
dc.rights | In Copyright | |
dc.subject.other | linked tensor decomposition | |
dc.subject.other | hierarchical alternating least squares | |
dc.subject.other | canonical polyadic | |
dc.subject.other | simultaneous extraction | |
dc.title | Generalization of Linked Canonical Polyadic Tensor Decomposition for Group Analysis | |
dc.type | conferenceObject | |
dc.identifier.urn | URN:NBN:fi:jyu-201907023544 | |
dc.contributor.laitos | Informaatioteknologian tiedekunta | fi |
dc.contributor.laitos | Faculty of Information Technology | en |
dc.contributor.oppiaine | Tietotekniikka | fi |
dc.contributor.oppiaine | Mathematical Information Technology | en |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | |
dc.date.updated | 2019-07-02T12:15:13Z | |
dc.relation.isbn | 978-3-030-22807-1 | |
dc.description.reviewstatus | peerReviewed | |
dc.format.pagerange | 180-189 | |
dc.relation.issn | 0302-9743 | |
dc.relation.numberinseries | 11555 | |
dc.type.version | acceptedVersion | |
dc.rights.copyright | © Springer Nature Switzerland AG 2019. | |
dc.rights.accesslevel | openAccess | fi |
dc.relation.conference | International Symposium on Neural Networks | |
dc.format.content | fulltext | |
dc.rights.url | http://rightsstatements.org/page/InC/1.0/?language=en | |
dc.relation.doi | 10.1007/978-3-030-22808-8_19 | |