Demo Data from EDBT 2026 / reviewers in the wild / expert
George Luta
dblp:09/8249 · also Gheorghe Luta
· DBLP profile ↗
5ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-4035-7632ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Artificial intelligence and machine learning · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › omics data analysis
cell-type deconvolution |
0.6 | 1 | 2022 | A2Sign: Agnostic Algorithms for Signatures - a universal method for identifying molecular signatures from transcriptomic datasets prior to cell-type deconvolution · Bioinform. 2022 |
Bioinformatics and computational biology › gene expression analysis
molecular signature analysis |
0.6 | 1 | 2022 | A2Sign: Agnostic Algorithms for Signatures - a universal method for identifying molecular signatures from transcriptomic datasets prior to cell-type deconvolution · Bioinform. 2022 |
Bioinformatics and computational biology
transcriptomics |
0.6 | 1 | 2022 | A2Sign: Agnostic Algorithms for Signatures - a universal method for identifying molecular signatures from transcriptomic datasets prior to cell-type deconvolution · Bioinform. 2022 |
Geometric modeling and processing › computational geometry › containment queries
point inclusion |
0.1 | 1 | 2010 | A new point containment test algorithm based on preprocessing and determining triangles · Comput. Aided Des. 2010 |
Methods — techniques the papers use, named apart from their topics
non-negative tensor factorization · 0.6matrix factorization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | A2Sign: Agnostic Algorithms for Signatures - a universal method for identifying molecular signatures from transcriptomic datasets prior to cell-type deconvolutionabstractMOTIVATION: Molecular signatures are critical for inferring the proportions of cell types from bulk transcriptomics data. However, the identification of these signatures is based on a methodology that relies on prior biological knowledge of the cell types being studied. When working with less known biological material, a data-driven approach is required to uncover the underlying classes and generate ad hoc signatures from healthy or pathogenic tissue. RESULTS: We present a new approach, A2Sign: Agnostic Algorithms for Signatures, based on a non-negative tensor factorization (NTF) strategy that allows us to identify cell-type-specific molecular signatures, greatly reduce collinearities and also account for inter-individual variability. We propose a global framework that can be applied to uncover molecular signatures for cell-type deconvolution in arbitrary tissues using bulk transcriptome data. We also present two new molecular signatures for deconvolution of up to 16 immune cell types using microarray or RNA-seq data. AVAILABILITY AND IMPLEMENTATION: All steps of our analysis were implemented in annotated Python notebooks (https://github.com/paulfogel/A2SIGN). To perform NTF, we used the NMTF package, which can be downloaded using Python pip install. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Galina Boldina, Paul Fogel, Corinne Rocher, Charles Bettembourg, George Luta, Franck Augé |
Bioinform. | 5 |
| 2020 | Tensor Networks for Latent Variable Analysis: Novel Algorithms for Tensor Train ApproximationabstractDecompositions of tensors into factor matrices, which interact through a core tensor, have found numerous applications in signal processing and machine learning. A more general tensor model that represents data as an ordered network of subtensors of order-2 or order-3 has, so far, not been widely considered in these fields, although this so-called tensor network (TN) decomposition has been long studied in quantum physics and scientific computing. In this article, we present novel algorithms and applications of TN decompositions, with a particular focus on the tensor train (TT) decomposition and its variants. The novel algorithms developed for the TT decomposition update, in an alternating way, one or several core tensors at each iteration and exhibit enhanced mathematical tractability and scalability for large-scale data tensors. For rigor, the cases of the given ranks, given approximation error, and the given error bound are all considered. The proposed algorithms provide well-balanced TT-decompositions and are tested in the classic paradigms of blind source separation from a single mixture, denoising, and feature extraction, achieving superior performance over the widely used truncated algorithms for TT decomposition. Anh Huy Phan 0001, Andrzej Cichocki, André Uschmajew, Petr Tichavský, George Luta, Danilo P. Mandic |
IEEE Trans. Neural Networks Learn. Syst. | 5 |
| 2013 | Tensor completion throughmultiple Kronecker product decompositionabstractWe propose a novel decomposition approach to impute missing values in tensor data. The method uses smaller scale multiway patches to model the whole data or a small volume encompassing the observed missing entries. Simulations on color images show that our method can recover color images using only 5–10% of pixels, and outperforms other available tensor completion methods. Anh Huy Phan 0001, Andrzej Cichocki, Petr Tichavský, George Luta, Austin J. Brockmeier |
ICASSP | 4 |
| 2010 | The curvHDR method for gating flow cytometry samplesabstractBACKGROUND: High-throughput flow cytometry experiments produce hundreds of large multivariate samples of cellular characteristics. These samples require specialized processing to obtain clinically meaningful measurements. A major component of this processing is a form of cell subsetting known as gating. Manual gating is time-consuming and subjective. Good automatic and semi-automatic gating algorithms are very beneficial to high-throughput flow cytometry. RESULTS: We develop a statistical procedure, named curvHDR, for automatic and semi-automatic gating. The method combines the notions of significant high negative curvature regions and highest density regions and has the ability to adapt well to human-perceived gates. The underlying principles apply to dimension of arbitrary size, although we focus on dimensions up to three. Accompanying software, compatible with contemporary flow cytometry infor-matics, is developed. CONCLUSION: The method is seen to adapt well to nuances in the data and, to a reasonable extent, match human perception of useful gates. It offers big savings in human labour when processing high-throughput flow cytometry data whilst retaining a good degree of efficacy. Ulrike Naumann, George Luta, Matthew P. Wand |
BMC Bioinform. | 2 |
| 2010 | A new point containment test algorithm based on preprocessing and determining triangles
Y. Q. Chen, José M. Maisog, George Luta |
Comput. Aided Des. | 4 |