Filters








170 Hits in 2.4 sec

RADE: Resource-Efficient Supervised Anomaly Detection Using Decision Tree-Based Ensemble Methods [article]

Shay Vargaftik, Isaac Keslassy, Ariel Orda, Yaniv Ben-Itzhak
2020 arXiv   pre-print
In this paper, we present, design, and evaluate RADE - a DTEM-based anomaly detection framework that augments standard DTEM classifiers and alleviates these drawbacks by relying on two observations: (1  ...  Decision-tree-based ensemble classification methods (DTEMs) are a prevalent tool for supervised anomaly detection.  ...  Boosting methods also share many of the aforementioned advantages offered by RF such as natural resilience to deal with imbalanced datasets and tiny classes, embedded feature selection, and ranking capabilities  ... 
arXiv:1909.11877v2 fatcat:cyy57n7znvaavhy2hoyk4pzoae

Groupoids in combinatorics -- applications of a theory of local symmetries [article]

Rade T. Zivaljevic
2006 arXiv   pre-print
with a collection of related open problems.  ...  theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs  ...  Acknowledgement: It is a pleasure to acknowledge encouragement, useful comments and suggestions by R. Brown, M. Joswig, J. Sullivan, G.  ... 
arXiv:math/0605508v1 fatcat:qjhqpl2kznb6lehnxhlqepiaua

Combinatorial groupoids, cubical complexes, and the Lovasz conjecture [article]

Rade T. Zivaljevic
2005 arXiv   pre-print
and graphs.  ...  Parallel transport of Hom-complexes and maps is used as a tool for extending Babson-Kozlov-Lovasz graph coloring results to more general statements about non-degenerate maps (colorings) of simplicial complexes  ...  of embeddings (immersions) of cubical surfaces into hypercubes or cubical lattices, the existence of a coloring of a graph G = (V G , E G ) with a prescribed number of colors etc., can all be approached  ... 
arXiv:math/0510204v2 fatcat:aqmoacyrkreyrjjphhn7spfp4y

Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture

Rade T. Živaljević
2008 Discrete & Computational Geometry  
and graphs.  ...  Parallel transport of Hom-complexes and maps is used as a tool for extending Babson-Kozlov-Lovász graph coloring results to more general statements about non-degenerate maps (colorings) of simplicial complexes  ...  of embeddings (immersions) of cubical surfaces into hypercubes or cubical lattices, the existence of a coloring of a graph G = (V G , E G ) with a prescribed number of colors etc., can all be approached  ... 
doi:10.1007/s00454-008-9062-1 fatcat:q54ati5pwzdibc5wodmcc7pkme

Performance of Different Diagnostic PD-L1 Clones in Head and Neck Squamous Cell Carcinoma

Julika Ribbat-Idel, Franz F Dressler, Rosemarie Krupar, Christian Watermann, Finn-Ole Paulsen, Patrick Kuppler, Luise Klapper, Anne Offermann, Barbara Wollenberg, Dirk Rades, Simon Laban, Markus Reischl (+3 others)
2021 Frontiers in Medicine  
checkpoint inhibitors in combination with specific diagnostic biomarkers presents new challenges to pathologists as tumor tissue needs to be tested for expression of programmed death-ligand 1 (PD-L1) for a  ...  Our data show a marked variation of staining results based on the diagnostic antibody used.  ...  Briefly, 2 mm diameter cores were punched out of the donor block's ROI and embedded into a paraffin recipient block.  ... 
doi:10.3389/fmed.2021.640515 pmid:33987192 pmcid:PMC8110724 fatcat:4vt7t5cwdferxffkjh6tbem6yq

Deep sequencing and automated histochemistry of human tissue slice cultures improve their usability as preclinical model for cancer research

Susann Haehnel, Kristin Reiche, Dennis Loeffler, Andreas Horn, Conny Blumert, Sven-Holger Puppel, Nicole Kaiser, Felicitas Rapp, Michael Rade, Friedemann Horn, Juergen Meixensberger, Ingo Bechmann (+2 others)
2019 Scientific Reports  
RNA sequencing was successfully accomplished with a sequencing depth of 243 to 368 x 106 reads per sample.  ...  Here, we demonstrate that slices are also suitable for whole transcriptome sequencing and present a method for automated histochemistry of whole slices.  ...  approach allowing to start treatment within a couple of days.  ... 
doi:10.1038/s41598-019-56509-5 pmid:31882946 pmcid:PMC6934722 fatcat:oq5j63bi7vgajph7x427zlyriy

Improved search for socially annotated data

Nikos Sarkas, Gautam Das, Nick Koudas
2009 Proceedings of the VLDB Endowment  
The availability of this information gives rise to a new searching paradigm where resources are retrieved and ranked based on the similarity of a keyword query to their accompanying tags.  ...  We experimentally validate the efficiency and effectiveness of our solutions compared to other applicable approaches.  ...  As it is evident, the RadING ranking strategy consistently outperforms the tf/idf based approaches for all values of k.  ... 
doi:10.14778/1687627.1687715 fatcat:3spovdczu5awfc5juoxzdqgj5y

DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy [article]

Haonan Lu, Hailin Hu, Xiaodong Lin
2022 arXiv   pre-print
To systematically tackle these problems, we have developed a novel knowledge graph embedding method, named DensE, to provide an improved modeling scheme for the complex composition patterns of relations  ...  Capturing the composition patterns of relations is a vital task in knowledge graph completion. It also serves as a fundamental step towards multi-hop reasoning over learned knowledge.  ...  A. Shen and Ms. X. Lin for insightful comments on the manuscript. We also thank Dr. Y. Guo and Ms. C. Jiang for helpful suggestions in the experimental settings.  ... 
arXiv:2008.04548v2 fatcat:3s2qqywjcvfhnj367rtwgpgj5e

JokeMeter at SemEval-2020 Task 7: Convolutional humor [article]

Martin Docekal, Martin Fajcik, Josef Jon, Pavel Smrz
2020 arXiv   pre-print
The system is based on convolutional neural network architecture.  ...  with our regression approach.  ...  Also, we experimented with a model that uses transformer architecture (ALBERT-base-v2). The neural models were implemented with PyTorch (Paszke et al., 2019) .  ... 
arXiv:2008.11053v1 fatcat:rfxoofhfxbhf7lqhwqeopsdlrq

LANGUAGE-AGNOSTIC SOURCE CODE RETRIEVAL USING KEYWORD & IDENTIFIER LEXICAL PATTERN

Oscar Karnalim
2018 International Journal of Software Engineering and Computer Systems  
To handle given issue, this paper proposes a source code retrieval approach which does not rely on programming-languagedependent features.  ...  Thus, each time a new programming language is developed, such retrieval system should be updated manually to handle that language.  ...  ., 2014) combines three ranking mechanisms which are graph-based, text-based, and structure-based ranking to yield the most appropriate results.  ... 
doi:10.15282/ijsecs.4.1.2018.3.0036 fatcat:iooqqldepbe2bnxiwfv6upetie

CoolMPS for robust sequencing of single-nuclear RNAs captured by droplet-based method [article]

Oliver Hahn, Tobias Fehlmann, Hui Zhang, Christy N. Munson, Ryan T. Vest, Adam Borcherding, Sophie Liu, Christian Villarosa, Snezana Drmanac, Rade Drmanac, Andreas Keller, Tony Wyss-Coray (+1 others)
2021
CoolMPS is a novel sequencing-by-synthesis approach that relies on nucleotide labeling by re-usable antibodies, but whether it is applicable to snRNA-seq has not been tested.  ...  In conclusion, our results show that CoolMPS provides a viable alternative to standard sequencing of RNA from dropletbased libraries.  ...  A sharednearest-neighbours graph was constructed based on the first 10 Principal component (PC) dimensions before clustering cells using Seurat's built-in FindClusters function with a resolution of 0.4  ... 
doi:10.22028/d291-33738 fatcat:4kjfvrzgpzbrnowxgmfwp224qe

Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments

Jiyan Yang, Xiangrui Meng, Michael W. Mahoney
2016 Proceedings of the IEEE  
., between the time to construct an embedding and the conditioning quality of the embedding, between the relative importance of computation versus communication, etc.) and demonstrate that ' 1 -and ' 2  ...  In this way, exabytes (10 18 bytes) of data are being created on a daily basis.  ...  We use k Á k p to denote the ' p -norm of a vector, k Á k 2 the spectral-norm of a matrix, k Á k F the Frobenius-norm of a matrix, and j Á j p the elementwise ' p -norm of a matrix.  ... 
doi:10.1109/jproc.2015.2494219 fatcat:rgcup2dosrantmgf5toywibvoa

Video Relationship Reasoning using Gated Spatio-Temporal Energy Graph [article]

Yao-Hung Hubert Tsai and Santosh Divvala and Louis-Philippe Morency and Ruslan Salakhutdinov and Ali Farhadi
2019 arXiv   pre-print
In this paper, we construct a Conditional Random Field on a fully-connected spatio-temporal graph that exploits the statistical dependency between relational entities spatially and temporally.  ...  For example, a relationship 'man, open, door' involves a complex relation 'open' between concrete entities 'man, door'.  ...  Our proposed approach jointly models the spatial and temporal structure of relationships in videos by constructing a fully-connected spatio-temporal graph (see Fig. 2 ).  ... 
arXiv:1903.10547v2 fatcat:bdysya3i6nc55pgip4qs23ed7q

Financial Cybercrime: A Comprehensive Survey of Deep Learning Approaches to Tackle the Evolving Financial Crime Landscape

Jack Nicholls, Aditya Kuppa, Nhien-An Le-Khac
2021 IEEE Access  
Self-supervised graph learning approaches techniques.  ...  Wu, Knowledge embedding based graph 2020.1747001 convolutional network.  ... 
doi:10.1109/access.2021.3134076 fatcat:lm2upcaoabbnbie6r4sfzhjh4y

Flow Distances on Open Flow Networks [article]

Liangzhu Guo, Xiaodan Lou, Peiteng Shi, Jun Wang, Xiaohan Huang, Jiang Zhang
2015 arXiv   pre-print
Open flow network is a weighted directed graph with a source and a sink, depicting flux distributions on networks in the steady state of an open flow system.  ...  They apparently deviate from the conventional random walk distance on a closed directed graph because they consider the openness of the flow network.  ...  However, conventional first-passage distance on a graph is based on the basic assumption that the whole network is closed, which means the random walker cannot escape from the network, thus the total number  ... 
arXiv:1501.06058v1 fatcat:cu5ylvr4dbcard3rxpkcrvtsea
« Previous Showing results 1 — 15 out of 170 results