| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
Author  |
Albert Gordo; Florent Perronnin | ||||
| Title | Asymmetric Distances for Binary Embeddings | Type | Conference Article | ||
| Year | 2011 | Publication | IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 729 - 736 | ||
| Keywords | |||||
| Abstract | In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH) and Semi-Supervised Hashing (SSH). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. We also propose a novel simple binary embedding technique – PCA Embedding (PCAE) – which is shown to yield competitive results with respect to more complex algorithms such as SH and SSH. | ||||
| Address | Providence, RI | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4577-0394-2 | Medium | ||
| Area | Expedition | Conference | CVPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GoP2011; IAM @ iam @ GoP2011 | Serial | 1817 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Florent Perronnin; Ernest Valveny | ||||
| Title | Large-scale document image retrieval and classification with runlength histograms and binary embeddings | Type | Journal Article | ||
| Year | 2013 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 46 | Issue | 7 | Pages | 1898-1905 |
| Keywords | visual document descriptor; compression; large-scale; retrieval; classification | ||||
| Abstract | We present a new document image descriptor based on multi-scale runlength
histograms. This descriptor does not rely on layout analysis and can be computed efficiently. We show how this descriptor can achieve state-of-theart results on two very different public datasets in classification and retrieval tasks. Moreover, we show how we can compress and binarize these descriptors to make them suitable for large-scale applications. We can achieve state-ofthe- art results in classification using binary descriptors of as few as 16 to 64 bits. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.042; 600.045; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ GPV2013 | Serial | 2306 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Florent Perronnin; Ernest Valveny | ||||
| Title | Document classification using multiple views | Type | Conference Article | ||
| Year | 2012 | Publication | 10th IAPR International Workshop on Document Analysis Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 33-37 | ||
| Keywords | |||||
| Abstract | The combination of multiple features or views when representing documents or other kinds of objects usually leads to improved results in classification (and retrieval) tasks. Most systems assume that those views will be available both at training and test time. However, some views may be too `expensive' to be available at test time. In this paper, we consider the use of Canonical Correlation Analysis to leverage `expensive' views that are available only at training time. Experimental results show that this information may significantly improve the results in a classification task. | ||||
| Address | Australia | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Computer Society Washington | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-0-7695-4661-2 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GPV2012 | Serial | 2049 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Florent Perronnin; Yunchao Gong; Svetlana Lazebnik | ||||
| Title | Asymmetric Distances for Binary Embeddings | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 36 | Issue | 1 | Pages | 33-47 |
| Keywords | |||||
| Abstract | In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH), PCA Embedding (PCAE), PCA Embedding with random rotations (PCAE-RR), and PCA Embedding with iterative quantization (PCAE-ITQ). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.045; 605.203; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ GPG2014 | Serial | 2272 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Jaume Gibert; Ernest Valveny; Marçal Rusiñol | ||||
| Title | A Kernel-based Approach to Document Retrieval | Type | Conference Article | ||
| Year | 2010 | Publication | 9th IAPR International Workshop on Document Analysis Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 377–384 | ||
| Keywords | |||||
| Abstract | In this paper we tackle the problem of document image retrieval by combining a similarity measure between documents and the probability that a given document belongs to a certain class. The membership probability to a specific class is computed using Support Vector Machines in conjunction with similarity measure based kernel applied to structural document representations. In the presented experiments, we use different document representations, both visual and structural, and we apply them to a database of historical documents. We show how our method based on similarity kernels outperforms the usual distance-based retrieval. | ||||
| Address | Boston; USA; | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-60558-773-8 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ GGV2010 | Serial | 1431 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Jose Antonio Rodriguez; Florent Perronnin; Ernest Valveny | ||||
| Title | Leveraging category-level labels for instance-level image retrieval | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3045-3052 | ||
| Keywords | |||||
| Abstract | In this article, we focus on the problem of large-scale instance-level image retrieval. For efficiency reasons, it is common to represent an image by a fixed-length descriptor which is subsequently encoded into a small number of bits. We note that most encoding techniques include an unsupervised dimensionality reduction step. Our goal in this work is to learn a better subspace in a supervised manner. We especially raise the following question: “can category-level labels be used to learn such a subspace?” To answer this question, we experiment with four learning techniques: the first one is based on a metric learning framework, the second one on attribute representations, the third one on Canonical Correlation Analysis (CCA) and the fourth one on Joint Subspace and Classifier Learning (JSCL). While the first three approaches have been applied in the past to the image retrieval problem, we believe we are the first to show the usefulness of JSCL in this context. In our experiments, we use ImageNet as a source of category-level labels and report retrieval results on two standard dataseis: INRIA Holidays and the University of Kentucky benchmark. Our experimental study shows that metric learning and attributes do not lead to any significant improvement in retrieval accuracy, as opposed to CCA and JSCL. As an example, we report on Holidays an increase in accuracy from 39.3% to 48.6% with 32-dimensional representations. Overall JSCL is shown to yield the best results. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GRP2012 | Serial | 2050 | ||
| Permanent link to this record | |||||
| Author |
Albert Gordo; Marçal Rusiñol; Dimosthenis Karatzas; Andrew Bagdanov | ||||
| Title | Document Classification and Page Stream Segmentation for Digital Mailroom Applications | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 621-625 | ||
| Keywords | |||||
| Abstract | In this paper we present a method for the segmentation of continuous page streams into multipage documents and the simultaneous classification of the resulting documents. We first present an approach to combine the multiple pages of a document into a single feature vector that represents the whole document. Despite its simplicity and low computational cost, the proposed representation yields results comparable to more complex methods in multipage document classification tasks. We then exploit this representation in the context of page stream segmentation. The most plausible segmentation of a page stream into a sequence of multipage documents is obtained by optimizing a statistical model that represents the probability of each segmented multipage document belonging to a particular class. Experimental results are reported on a large sample of real administrative multipage documents. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.056; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ GRK2013c | Serial | 2345 | ||
| Permanent link to this record | |||||
| Author |
Albert Rial-Farras; Meysam Madadi; Sergio Escalera | ||||
| Title | UV-based reconstruction of 3D garments from a single RGB image | Type | Conference Article | ||
| Year | 2021 | Publication | 16th IEEE International Conference on Automatic Face and Gesture Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1-8 | ||
| Keywords | |||||
| Abstract | Garments are highly detailed and dynamic objects made up of particles that interact with each other and with other objects, making the task of 2D to 3D garment reconstruction extremely challenging. Therefore, having a lightweight 3D representation capable of modelling fine details is of great importance. This work presents a deep learning framework based on Generative Adversarial Networks (GANs) to reconstruct 3D garment models from a single RGB image. It has the peculiarity of using UV maps to represent 3D data, a lightweight representation capable of dealing with high-resolution details and wrinkles. With this model and kind of 3D representation, we achieve state-of-the-art results on the CLOTH3D++ dataset, generating good quality and realistic garment reconstructions regardless of the garment topology and shape, human pose, occlusions and lightning. | ||||
| Address | Virtual; December 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FG | ||
| Notes | HUPBA; no proj | Approved | no | ||
| Call Number | Admin @ si @ RME2021 | Serial | 3639 | ||
| Permanent link to this record | |||||
| Author |
Albert Suso; Pau Riba; Oriol Ramos Terrades; Josep Llados | ||||
| Title | A Self-supervised Inverse Graphics Approach for Sketch Parametrization | Type | Conference Article | ||
| Year | 2021 | Publication | 16th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | 12916 | Issue | Pages | 28-42 | |
| Keywords | |||||
| Abstract | The study of neural generative models of handwritten text and human sketches is a hot topic in the computer vision field. The landmark SketchRNN provided a breakthrough by sequentially generating sketches as a sequence of waypoints, and more recent articles have managed to generate fully vector sketches by coding the strokes as Bézier curves. However, the previous attempts with this approach need them all a ground truth consisting in the sequence of points that make up each stroke, which seriously limits the datasets the model is able to train in. In this work, we present a self-supervised end-to-end inverse graphics approach that learns to embed each image to its best fit of Bézier curves. The self-supervised nature of the training process allows us to train the model in a wider range of datasets, but also to perform better after-training predictions by applying an overfitting process on the input binary image. We report qualitative an quantitative evaluations on the MNIST and the Quick, Draw! datasets. | ||||
| Address | Lausanne; Suissa; September 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ SRR2021 | Serial | 3675 | ||
| Permanent link to this record | |||||
| Author |
Albert Tatjer; Bhalaji Nagarajan; Ricardo Marques; Petia Radeva | ||||
| Title | CCLM: Class-Conditional Label Noise Modelling | Type | Conference Article | ||
| Year | 2023 | Publication | 11th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 14062 | Issue | Pages | 3-14 | |
| Keywords | |||||
| Abstract | The performance of deep neural networks highly depends on the quality and volume of the training data. However, cost-effective labelling processes such as crowdsourcing and web crawling often lead to data with noisy (i.e., wrong) labels. Making models robust to this label noise is thus of prime importance. A common approach is using loss distributions to model the label noise. However, the robustness of these methods highly depends on the accuracy of the division of training set into clean and noisy samples. In this work, we dive in this research direction highlighting the existing problem of treating this distribution globally and propose a class-conditional approach to split the clean and noisy samples. We apply our approach to the popular DivideMix algorithm and show how the local treatment fares better with respect to the global treatment of loss distribution. We validate our hypothesis on two popular benchmark datasets and show substantial improvements over the baseline experiments. We further analyze the effectiveness of the proposal using two different metrics – Noise Division Accuracy and Classiness. | ||||
| Address | Alicante; Spain; June 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | IbPRIA | ||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ TNM2023 | Serial | 3925 | ||
| Permanent link to this record | |||||
| Author |
Alberto Hidalgo; Ferran Poveda; Enric Marti;Debora Gil;Albert Andaluz; Francesc Carreras; Manuel Ballester | ||||
| Title | Evidence of continuous helical structure of the cardiac ventricular anatomy assessed by diffusion tensor imaging magnetic resonance multiresolution tractography | Type | Journal Article | ||
| Year | 2012 | Publication | European Radiology | Abbreviated Journal | ECR |
| Volume | 3 | Issue | 1 | Pages | 361-362 |
| Keywords | |||||
| Abstract | Deep understanding of myocardial structure linking morphology and func- tion of the heart would unravel crucial knowledge for medical and surgical clinical procedures and studies. Diffusion tensor MRI provides a discrete measurement of the 3D arrangement of myocardial fibres by the observation of local anisotropic
diffusion of water molecules in biological tissues. In this work, we present a multi- scale visualisation technique based on DT-MRI streamlining capable of uncovering additional properties of the architectural organisation of the heart. Methods and Materials: We selected the John Hopkins University (JHU) Canine Heart Dataset, where the long axis cardiac plane is aligned with the scanner’s Z- axis. Their equipment included a 4-element passed array coil emitting a 1.5 T. For DTI acquisition, a 3D-FSE sequence is apply. We used 200 seeds for full-scale tractography, while we applied a MIP mapping technique for simplified tractographic reconstruction. In this case, we reduced each DTI 3D volume dimensions by order- two magnitude before streamlining. Our simplified tractographic reconstruction method keeps the main geometric features of fibres, allowing for an easier identification of their global morphological disposition, including the ventricular basal ring. Moreover, we noticed a clearly visible helical disposition of the myocardial fibres, in line with the helical myocardial band ventricular structure described by Torrent-Guasp. Finally, our simplified visualisation with single tracts identifies the main segments of the helical ventricular architecture. DT-MRI makes possible the identification of a continuous helical architecture of the myocardial fibres, which validates Torrent-Guasp’s helical myocardial band ventricular anatomical model. |
||||
| Address | Viena, Austria | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Link | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1869-4101 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ HPM2012 | Serial | 1858 | ||
| Permanent link to this record | |||||
| Author |
Albin Soutif; Antonio Carta; Andrea Cossu; Julio Hurtado; Hamed Hemati; Vincenzo Lomonaco; Joost Van de Weijer | ||||
| Title | A Comprehensive Empirical Evaluation on Online Continual Learning | Type | Conference Article | ||
| Year | 2023 | Publication | Visual Continual Learning (ICCV-W) | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Online continual learning aims to get closer to a live learning experience by learning directly on a stream of data with temporally shifting distribution and by storing a minimum amount of data from that stream. In this empirical evaluation, we evaluate various methods from the literature that tackle online continual learning. More specifically, we focus on the class-incremental setting in the context of image classification, where the learner must learn new classes incrementally from a stream of data. We compare these methods on the Split-CIFAR100 and Split-TinyImagenet benchmarks, and measure their average accuracy, forgetting, stability, and quality of the representations, to evaluate various aspects of the algorithm at the end but also during the whole training period. We find that most methods suffer from stability and underfitting issues. However, the learned representations are comparable to i.i.d. training under the same computational budget. No clear winner emerges from the results and basic experience replay, when properly tuned and implemented, is a very strong baseline. We release our modular and extensible codebase at this https URL based on the avalanche framework to reproduce our results and encourage future research. | ||||
| Address | Paris; France; October 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICCVW | ||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ SCC2023 | Serial | 3938 | ||
| Permanent link to this record | |||||
| Author |
Albin Soutif; Antonio Carta; Joost Van de Weijer | ||||
| Title | Improving Online Continual Learning Performance and Stability with Temporal Ensembles | Type | Conference Article | ||
| Year | 2023 | Publication | 2nd Conference on Lifelong Learning Agents | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Neural networks are very effective when trained on large datasets for a large number of iterations. However, when they are trained on non-stationary streams of data and in an online fashion, their performance is reduced (1) by the online setup, which limits the availability of data, (2) due to catastrophic forgetting because of the non-stationary nature of the data. Furthermore, several recent works (Caccia et al., 2022; Lange et al., 2023) arXiv:2205.13452 showed that replay methods used in continual learning suffer from the stability gap, encountered when evaluating the model continually (rather than only on task boundaries). In this article, we study the effect of model ensembling as a way to improve performance and stability in online continual learning. We notice that naively ensembling models coming from a variety of training tasks increases the performance in online continual learning considerably. Starting from this observation, and drawing inspirations from semi-supervised learning ensembling methods, we use a lightweight temporal ensemble that computes the exponential moving average of the weights (EMA) at test time, and show that it can drastically increase the performance and stability when used in combination with several methods from the literature. | ||||
| Address | Montreal; Canada; August 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | COLLAS | ||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ SCW2023 | Serial | 3922 | ||
| Permanent link to this record | |||||
| Author |
Albin Soutif; Marc Masana; Joost Van de Weijer; Bartlomiej Twardowski | ||||
| Title | On the importance of cross-task features for class-incremental learning | Type | Conference Article | ||
| Year | 2021 | Publication | Theory and Foundation of continual learning workshop of ICML | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | In class-incremental learning, an agent with limited resources needs to learn a sequence of classification tasks, forming an ever growing classification problem, with the constraint of not being able to access data from previous tasks. The main difference with task-incremental learning, where a task-ID is available at inference time, is that the learner also needs to perform crosstask discrimination, i.e. distinguish between classes that have not been seen together. Approaches to tackle this problem are numerous and mostly make use of an external memory (buffer) of non-negligible size. In this paper, we ablate the learning of crosstask features and study its influence on the performance of basic replay strategies used for class-IL. We also define a new forgetting measure for class-incremental learning, and see that forgetting is not the principal cause of low performance. Our experimental results show that future algorithms for class-incremental learning should not only prevent forgetting, but also aim to improve the quality of the cross-task features. This is especially important when the number of classes per task is small. | ||||
| Address | Virtual; July 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICMLW | ||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ SMW2021 | Serial | 3588 | ||
| Permanent link to this record | |||||
| Author |
Alejandro Ariza-Casabona; Bartlomiej Twardowski; Tri Kurniawan Wijaya | ||||
| Title | Exploiting Graph Structured Cross-Domain Representation for Multi-domain Recommendation | Type | Conference Article | ||
| Year | 2023 | Publication | European Conference on Information Retrieval – ECIR 2023: Advances in Information Retrieval | Abbreviated Journal | |
| Volume | 13980 | Issue | Pages | 49–65 | |
| Keywords | |||||
| Abstract | Multi-domain recommender systems benefit from cross-domain representation learning and positive knowledge transfer. Both can be achieved by introducing a specific modeling of input data (i.e. disjoint history) or trying dedicated training regimes. At the same time, treating domains as separate input sources becomes a limitation as it does not capture the interplay that naturally exists between domains. In this work, we efficiently learn multi-domain representation of sequential users’ interactions using graph neural networks. We use temporal intra- and inter-domain interactions as contextual information for our method called MAGRec (short for Multi-dom Ain Graph-based Recommender). To better capture all relations in a multi-domain setting, we learn two graph-based sequential representations simultaneously: domain-guided for recent user interest, and general for long-term interest. This approach helps to mitigate the negative knowledge transfer problem from multiple domains and improve overall representation. We perform experiments on publicly available datasets in different scenarios where MAGRec consistently outperforms state-of-the-art methods. Furthermore, we provide an ablation study and discuss further extensions of our method. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ECIR | ||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ ATK2023 | Serial | 3933 | ||
| Permanent link to this record | |||||