Filters








64,601 Hits in 2.5 sec

Incorporating Side Information in Tensor Completion

Hemank Lamba, Vaishnavh Nagarajan, Kijung Shin, Naji Shajarisales
2016 Proceedings of the 25th International Conference Companion on World Wide Web - WWW '16 Companion  
We explore the idea of using external information in completing missing values in tensors.  ...  In this work, we present a framework that employs side information as kernel matrices for tensor factorization.  ...  These similarities, obtained from side information, can be exploited to improve the quality of tensor completion.  ... 
doi:10.1145/2872518.2889371 dblp:conf/www/LambaNSS16 fatcat:mgrqomtcsve3jgco36mtnannlu

Inductive Framework for Multi-Aspect Streaming Tensor Completion with Side Information [article]

Madhav Nimishakavi, Bamdev Mishra, Manish Gupta, Partha Talukdar
2018 arXiv   pre-print
We bridge this gap in this paper by proposing a dynamic tensor completion framework called Side Information infused Incremental Tensor Analysis (SIITA), which incorporates side information and works for  ...  To the best of our Knowledge, there is no previous work which incorporates side information with dynamic tensor completion.  ...  Acknowledgement This work is supported in part by the Ministry of Human Resource Development (MHRD), Government of India.  ... 
arXiv:1802.06371v3 fatcat:yiaywsco6fhz3khe6ad74fv47a

Tensor factorization using auxiliary information

Atsuhiro Narita, Kohei Hayashi, Ryota Tomioka, Hisashi Kashima
2012 Data mining and knowledge discovery  
In this paper, we propose to use relationships among data as auxiliary information in addition to the low-rank assumption to improve the quality of tensor decomposition.  ...  Numerical experiments on tensor completion using synthetic and benchmark datasets show that the use of auxiliary information improves completion accuracy over the existing methods based only on the low-rank  ...  [2] extended the probabilistic matrix factorization [16] to incorporate side information. In their work, Gaussian process priors are introduced to enforce smoothness to factors.  ... 
doi:10.1007/s10618-012-0280-z fatcat:ducuux7qincvjjsodwlzuwawre

Tensor Factorization Using Auxiliary Information [chapter]

Atsuhiro Narita, Kohei Hayashi, Ryota Tomioka, Hisashi Kashima
2011 Lecture Notes in Computer Science  
In this paper, we propose to use relationships among data as auxiliary information in addition to the low-rank assumption to improve the quality of tensor decomposition.  ...  Numerical experiments on tensor completion using synthetic and benchmark datasets show that the use of auxiliary information improves completion accuracy over the existing methods based only on the low-rank  ...  [2] extended the probabilistic matrix factorization [16] to incorporate side information. In their work, Gaussian process priors are introduced to enforce smoothness to factors.  ... 
doi:10.1007/978-3-642-23783-6_32 fatcat:re354pzn3fg3pefqxw6t6kp6wq

Note: low-rank tensor train completion with side information based on Riemannian optimization [article]

Stanislav Budzinskiy, Nikolai Zamarashkin
2020 arXiv   pre-print
We consider the low-rank tensor train completion problem when additional side information is available in the form of subspaces that contain the mode-k fiber spans.  ...  Numerical experiments show that the proposed algorithm requires far fewer known entries to recover the tensor compared to standard tensor train completion methods.  ...  Conclusion In this paper we presented the RTTC-SI algorithm for low-rank TT completion with side information and numerically studied the effects of side information on the phase transition curve.  ... 
arXiv:2006.12798v1 fatcat:qvek4axhi5dnriqxx36uxec5na

Tensor Completion with Side Information: A Riemannian Manifold Approach

Tengfei Zhou, Hui Qian, Zebang Shen, Chao Zhang, Congfu Xu
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
By restricting the iterate on a nonlinear manifold, the recently proposed Riemannian optimization methods prove to be both efficient and effective in low rank tensor completion problems.  ...  To fill the gap, in this paper, a novel Riemannian model is proposed to tightly integrate the original model and the side information by overcoming their inconsistency.  ...  Conclusion In this paper, we exploit the side information to improve the accuracy of Riemannian tensor completion. A novel Riemannian model is proposed.  ... 
doi:10.24963/ijcai.2017/495 dblp:conf/ijcai/ZhouQSZX17 fatcat:mx3kipwibnejfiavwk74nhkg7m

Generation of Pseudocontact Shifts in Protein NMR Spectra with a Genetically Encoded Cobalt(II)-Binding Amino Acid

Thi Hoang Duong Nguyen, Kiyoshi Ozawa, Mitchell Stanton-Cook, Russell Barrow, Thomas Huber, Gottfried Otting
2010 Angewandte Chemie  
The side chains of BpyAla87, Asp145, and Gln86 are shown in black. The figure was created with PyMOL (see the Supporting Information for a color version).  ...  Fitting of the Dc tensor showed that the Co II ion was located near the side chain of residue 87, as expected.  ... 
doi:10.1002/ange.201005672 fatcat:p2bi2xbuwneq5eheixk7y3toia

Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation

Juan Andres Bazerque, Gonzalo Mateos, Georgios B. Giannakis
2013 IEEE Transactions on Signal Processing  
Set in a Bayesian framework, the tensor completion method incorporates prior information to enhance its smoothing and prediction capabilities.  ...  The proposed technique is able to recover the "ground-truth" tensor rank when tested on synthetic data, and to complete brain imaging and yeast gene expression datasets with 50% and 15% of missing entries  ...  correlations as side information.  ... 
doi:10.1109/tsp.2013.2278516 fatcat:yot26kwpljduvhmlf2ao6l7qku

Delineation and geometric modeling of road networks

Charalambos Poullis, Suya You
2010 ISPRS journal of photogrammetry and remote sensing (Print)  
Secondly, a novel orientation-based segmentation is presented which incorporates the classification of the perceptual grouping, and results in segmentations with better defined boundaries and continuous  ...  This information is then used for creating road segments and transforming them to their polygonal representations.  ...  An advantage of the proposed orientation-based segmentation is that by incorporating orientation information in the optimization process it ensures that linear segments are not severed, even in the case  ... 
doi:10.1016/j.isprsjprs.2009.10.004 fatcat:m2bnvceptrhobizt63erj7rcqm

Tensor Completion Algorithms in Big Data Analytics [article]

Qingquan Song, Hancheng Ge, James Caverlee, Xia Hu
2018 arXiv   pre-print
We characterize these advances from four perspectives: general tensor completion algorithms, tensor completion with auxiliary information (variety), scalable tensor completion algorithms (volume), and  ...  Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining  ...  erent side information here for be er coverage of related advances.  ... 
arXiv:1711.10105v2 fatcat:onu2bket3na3dmfsmzhc7byqku

Knowledge Completion for Generics using Guided Tensor Factorization [article]

Hanie Sedghi, Ashish Sabharwal
2018 arXiv   pre-print
Our results demonstrate that external information, such as relation schemas and entity taxonomies, if used appropriately, can be a surprisingly powerful tool in this setting.  ...  We show that existing KB completion methods struggle with this new task, and present the first approach that is successful.  ...  Acknowledgments The authors would like to thank Peter Clark for fruitful discussions, valuable feedback, and crowdsourcing annotations; Matt Gardner for constructive comments and assessing graph-based completion  ... 
arXiv:1612.03871v3 fatcat:ldfpigzeuzflbhodhhvmtekdle

Covariate-assisted Sparse Tensor Completion [article]

Hilda S Ibriga, Will Wei Sun
2022 arXiv   pre-print
In this paper, we propose Covariate-assisted Sparse Tensor Completion (COSTCO) to incorporate covariate information for the recovery of the sparse tensor.  ...  We aim to provably complete a sparse and highly-missing tensor in the presence of covariate information along tensor modes.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the Office of Naval Research.  ... 
arXiv:2103.06428v3 fatcat:y6ysnxhjqrba7hgi33zqebtdp4

MLCTR: A Fast Scalable Coupled Tensor Completion Based on Multi-Layer Non-Linear Matrix Factorization [article]

Ajim Uddin, Dan Zhou, Xinyuan Tao, Chia-Ching Chou, Dantong Yu
2021 arXiv   pre-print
Experiments confirm that our strategy of incorporating non-linearity in factor matrices demonstrates impressive performance in embedding learning and end-to-end tensor models, and outperforms approaches  ...  This paper focuses on the embedding learning aspect of the tensor completion problem and proposes a new multi-layer neural network architecture for tensor factorization and completion (MLCTR).  ...  In POI-3D we overcome this limitation by incorporating time information available in the data and replace location id with time to represent tensor as (user id, poi id, time).  ... 
arXiv:2109.01773v1 fatcat:phyo4vfe3rh75hdjpvjsfjvr54

Distributed-Memory Tensor Completion for Generalized Loss Functions in Python using New Sparse Tensor Kernels [article]

Navjot Singh, Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik
2021 arXiv   pre-print
To make possible tensor completion for very sparse tensors, we introduce new multi-tensor primitives, for which we provide specialized parallel implementations.  ...  time in experiments.  ...  completion algorithms that use second order information.  ... 
arXiv:1910.02371v3 fatcat:nrxjrkde7baulfn4zdj3vmlgcm

Score Guided Musical Source Separation Using Generalized Coupled Tensor Factorization

Ali Taylan Cemgil, Umut Simsekli
2012 Zenodo  
Publication in the conference proceedings of EUSIPCO, Bucharest, Romania, 2012  ...  The aim in this model is to incorporate spectral information by coupling the observed mixture with isolated note recordings.  ...  The second model also incorporates spectral information, however instead of using a temporally aligned transcription, this model incorporates harmonic information by taking an approximate, incomplete,  ... 
doi:10.5281/zenodo.51989 fatcat:6koth5r5dve3hlvdvjp3l4dbhe
« Previous Showing results 1 — 15 out of 64,601 results