Näytä suppeat kuvailutiedot

dc.contributor.authorWang, Xiulin
dc.contributor.authorZhang, Chi
dc.contributor.authorRistaniemi, Tapani
dc.contributor.authorCong, Fengyu
dc.contributor.editorLu, Huchuan
dc.contributor.editorTang, Huajin
dc.contributor.editorWang, Zhanshan
dc.date.accessioned2019-07-03T04:57:17Z
dc.date.available2019-07-03T04:57:17Z
dc.date.issued2019
dc.identifier.citationWang, 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.otherCONVID_31253760
dc.identifier.otherTUTKAID_81824
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/64969
dc.description.abstractReal-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.extent615
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherSpringer International Publishing
dc.relation.ispartofISNN 2019 : Advances in Neural Networks : 16th International Symposium on Neural Networks, Proceedings, Part II
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.rightsIn Copyright
dc.subject.otherlinked tensor decomposition
dc.subject.otherhierarchical alternating least squares
dc.subject.othercanonical polyadic
dc.subject.othersimultaneous extraction
dc.titleGeneralization of Linked Canonical Polyadic Tensor Decomposition for Group Analysis
dc.typeconferenceObject
dc.identifier.urnURN:NBN:fi:jyu-201907023544
dc.contributor.laitosInformaatioteknologian tiedekuntafi
dc.contributor.laitosFaculty of Information Technologyen
dc.contributor.oppiaineTietotekniikkafi
dc.contributor.oppiaineMathematical Information Technologyen
dc.type.urihttp://purl.org/eprint/type/ConferencePaper
dc.date.updated2019-07-02T12:15:13Z
dc.relation.isbn978-3-030-22807-1
dc.description.reviewstatuspeerReviewed
dc.format.pagerange180-189
dc.relation.issn0302-9743
dc.relation.numberinseries11555
dc.type.versionacceptedVersion
dc.rights.copyright© Springer Nature Switzerland AG 2019.
dc.rights.accesslevelopenAccessfi
dc.relation.conferenceInternational Symposium on Neural Networks
dc.format.contentfulltext
dc.rights.urlhttp://rightsstatements.org/page/InC/1.0/?language=en
dc.relation.doi10.1007/978-3-030-22808-8_19


Aineistoon kuuluvat tiedostot

Thumbnail

Aineisto kuuluu seuraaviin kokoelmiin

Näytä suppeat kuvailutiedot

In Copyright
Ellei muuten mainita, aineiston lisenssi on In Copyright