• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 51
Next 10 →

Generalised Coupled Tensor Factorisation

by Y. Kenan, Yılmaz A. Taylan, Cemgil Umut S¸ims¸ekli
"... We derive algorithms for generalised tensor factorisation (GTF) by building upon the well-established theory of Generalised Linear Models. Our algorithms are general in the sense that we can compute arbitrary factorisations in a message passing framework, derived for a broad class of exponential fam ..."
Abstract - Add to MetaCart
easily to address the problems when multiple observed tensors are factorised simultaneously. We illustrate our coupled factorisation approach on synthetic data as well as on a musical audio restoration problem. 1

prediction via generalized coupled tensor factorisation

by Beyza Ermis, Evrim Acar, A. Taylan Cemgil - in ECML/PKDDWorkshop on Collective Learning and Inference on Structured Data , 2012
"... Abstract. This study deals with the missing link prediction problem: the problem of predicting the existence of missing connections between entities of interest. We address link prediction using coupled analysis of relational datasets represented as heterogeneous data, i.e., datasets in the form of ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
of matrices and higher-order tensors. We propose to use an approach based on probabilistic interpretation of tensor factorisation models, i.e., Generalised Coupled Tensor Factorisation, which can simultaneously fit a large class of tensor models to higher-order tensors/matrices with com-mon latent factors

SCORE GUIDED AUDIO RESTORATION VIA GENERALISED COUPLED TENSOR FACTORISATION

by Y. Kenan Yılmaz, A. Taylan Cemgil
"... Generalised coupled tensor factorisation is a recently proposed algorithmic framework for simultaneously estimating tensor factorisation models where several observed tensors can share a set of latent factors. This paper proposes a model in this framework for coupled factorisation of piano spectrogr ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Generalised coupled tensor factorisation is a recently proposed algorithmic framework for simultaneously estimating tensor factorisation models where several observed tensors can share a set of latent factors. This paper proposes a model in this framework for coupled factorisation of piano

Aggregation and Ordering in Factorised Databases

by Nurzhan Bakibayev, Dan Olteanu
"... Acommonapproach todataanalysis involvesunderstanding andmanipulatingsuccinctrepresentationsofdata. Inearlier work, we put forward a succinct representation system for relational data called factorised databases and reported on the main-memory query engine FDB for select-project-join queries on such ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
on such databases. In this paper, we extend FDB to support a larger class of practical queries with aggregates and ordering. This requires novel optimisation and evaluation techniques. We show how factorisation coupled with partial aggregation can effectively reduce the number of operations needed for query

DAMTP 96/48 THE SOFT POMERON

by P V Landshoff , 1996
"... The soft pomeron successfully correlates a wide variety of data. Its properties seem rather simple: it couples to single quarks and its coupling factorises. 1 ..."
Abstract - Add to MetaCart
The soft pomeron successfully correlates a wide variety of data. Its properties seem rather simple: it couples to single quarks and its coupling factorises. 1

Non-Factorisable Z2 × Z2 Heterotic Orbifold Models and Yukawa Couplings

by Stefan Förste, Tatsuo Kobayashi, Hiroshi Ohki, Kei-jiro Takahashi , 2006
"... We classify compactification lattices for supersymmetric Z2×Z2 orbifolds. These lattices include factorisable as well as non-factorisable six-tori. Different models lead to different numbers of fixed points/tori. A lower bound on the number of fixed tori per twisted sector is given by four, whereas ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We classify compactification lattices for supersymmetric Z2×Z2 orbifolds. These lattices include factorisable as well as non-factorisable six-tori. Different models lead to different numbers of fixed points/tori. A lower bound on the number of fixed tori per twisted sector is given by four, whereas

Dimensional regularisation and factorisation schemes in the bfkl equation at subleading level

by M. Ciafaloni, D. Colferai , 2005
"... We study the anomalous dimensions and coefficient functions generated by the BFKL equation in 4 + 2ε dimensions, by investigating both running coupling effects, and the inclusion of the full next-to-leading kernel. After generalising the Fourier representation of the solutions to this case, we analy ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
We study the anomalous dimensions and coefficient functions generated by the BFKL equation in 4 + 2ε dimensions, by investigating both running coupling effects, and the inclusion of the full next-to-leading kernel. After generalising the Fourier representation of the solutions to this case, we

Improving Learning for Embodied Agents in Dynamic Environments by State Factorisation

by David Jacob, Daniel Polani, Chrystopher L. Nehaniv
"... A new reinforcement learning algorithm designed specifically for robots and embodied systems is described. Conventional reinforcement learning methods intended for learning general tasks suffer from a number of disadvantages in this domain including slow learning speed, an inability to generalise be ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
between states, reduced performance in dynamic environments, and a lack of scalability. Factor-Q, the new algorithm, uses factorised state and action, coupled with multiple structured rewards, to address these issues. Initial experimental results demonstrate that Factor-Q is able to learn as efficiently

Recognition of group activities using dynamic probabilistic networks

by Shaogang Gong, Tao Xiang - Computer Vision, 2003. Proceedings. Ninth IEEE International Conference
"... Dynamic Probabilistic Networks (DPNs) are exploited for modelling the temporal relationships among a set of dif-ferent object temporal events in the scene for a coherent and robust scene-level behaviour interpretation. In particu-lar, we develop a Dynamically Multi-Linked Hidden Markov Model (DML-HM ..."
Abstract - Cited by 127 (22 self) - Add to MetaCart
. A DML-HMM is built using Schwarz’s Bayesian Information Cri-terion based factorisation resulting in its topology being in-trinsically determined by the underlying causality and tem-poral order among different object events. Our experiments demonstrate that its performance on modelling group activ

Coupled dictionary training for exemplar-based speech enhancement

by Deepak Baby, Tuomas Virtanen, Tom Barker, Hugo Van - in Proc. of ICASSP , 2014
"... In exemplar-based speech enhancement systems, lower dimen-sional features are preferred over the full-scale DFT features for their reduced computational complexity and the ability to better gener-alize for the unseen cases. But in order to obtain the Wiener-like filter for noisy DFT enhancement, the ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
-based speech enhancement. Index Terms — Non-negative matrix factorisation, coupled dic-tionary training, speech enhancement, modulation envelope 1.
Next 10 →
Results 1 - 10 of 51
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University