Brijnesh J. Jain

Vincent Froese

J. Glob. Optim., August, 2023

When algorithm selection meets Bi-linear Learning to Rank: accuracy and inference time trade off with candidates expansion.

[BibT_eX]

[DOI]

Int. J. Data Sci. Anal., August, 2023

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series.

[BibT_eX]

[DOI]

Algorithmica, February, 2023

2021

Warped softmax regression for time series classification.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

2020

Comparing temporal graphs using dynamic time warping.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2020

Sufficient conditions for the existence of a sample mean of time series under dynamic time warping.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2020

2019

Revisiting inaccuracies of time series averaging under dynamic time warping.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2019

Making the dynamic time warping distance warping-invariant.

[BibT_eX]

[DOI]

Pattern Recognit., 2019

Exact mean computation in dynamic time warping spaces.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

2018

Nonsmooth analysis and subgradient methods for averaging in dynamic time warping spaces.

[BibT_eX]

[DOI]

Pattern Recognit., 2018

Asymmetric learning vector quantization for efficient nearest neighbor classification in dynamic time warping spaces.

[BibT_eX]

[DOI]

Pattern Recognit., 2018

The Mean Partition Theorem in consensus clustering.

[BibT_eX]

[DOI]

Pattern Recognit., 2018

Semi-Metrification of the Dynamic Time Warping Distance.

[BibT_eX]

[DOI]

CoRR, 2018

Gamification in E-Commerce: Tangible vs. Intangible Rewards.

[BibT_eX]

[DOI]

Michael Meder

Till Plumbaum

Aleksander Raczkowski

Proceedings of the 22nd International Academic Mindtrek Conference, 2018

Condorcet's Jury Theorem for Consensus Clustering.

[BibT_eX]

[DOI]

Proceedings of the KI 2018: Advances in Artificial Intelligence, 2018

2017

Consistency of mean partitions in consensus clustering.

[BibT_eX]

[DOI]

Pattern Recognit., 2017

Warped-Linear Models for Time Series Classification.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal Warping Paths are unique for almost every pair of Time Series.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Statistical graph space analysis.

[BibT_eX]

[DOI]

Pattern Recognit., 2016

On the geometry of graph spaces.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A Reduction Theorem for the Sample Mean in Dynamic Time Warping Spaces.

[BibT_eX]

[DOI]

CoRR, 2016

Homogeneity of Cluster Ensembles.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Generalized gradient learning on time series.

[BibT_eX]

[DOI]

Mach. Learn., 2015

Asymptotic Behavior of Mean Partitions in Consensus Clustering.

[BibT_eX]

[DOI]

CoRR, 2015

Properties of the Sample Mean in Graph Spaces and the Majorize-Minimize-Mean Algorithm.

[BibT_eX]

[DOI]

CoRR, 2015

Geometry of Graph Edit Distance Spaces.

[BibT_eX]

[DOI]

CoRR, 2015

Generalized Gradient Learning on Time Series under Elastic Transformations.

[BibT_eX]

[DOI]

CoRR, 2015

Dimension Reduction in Dissimilarity Spaces for Time Series Classification.

[BibT_eX]

[DOI]

Proceedings of the Advanced Analysis and Learning on Temporal Data, 2015

Time Series Classification in Dissimilarity Spaces.

[BibT_eX]

[DOI]

Proceedings of the 1st International Workshop on Advanced Analytics and Learning on Temporal Data, 2015

2014

The Gamification Design Problem.

[BibT_eX]

[DOI]

Michael Meder

CoRR, 2014

Flip-Flop Sublinear Models for Graphs: Proof of Theorem 1.

[BibT_eX]

[DOI]

CoRR, 2014

Sublinear Models for Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Flip-Flop Sublinear Models for Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2014

Fast time series classification under lucky time warping distance.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Applied Computing, 2014

Users' reading habits in online news portals.

[BibT_eX]

[DOI]

Cagdas Esiyok

Benjamin Kille

Frank Hopfgartner

Proceedings of the Fifth Information Interaction in Context Symposium, 2014

Margin Perceptrons for Graphs.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Pattern Recognition, 2014

2013

A 3D approach to recommender system evaluation.

[BibT_eX]

[DOI]

Alan Said

Proceedings of the Computer Supported Cooperative Work, 2013

User-centric evaluation of a K-furthest neighbor collaborative filtering recommender algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computer Supported Cooperative Work, 2013

Mixtures of Radial Densities for Clustering Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Analysis of Images and Patterns, 2013

2012

Maximum likelihood method for parameter estimation of bell-shaped functions on graphs.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2012

Learning in Riemannian Orbifolds

[BibT_eX]

[DOI]

CoRR, 2012

Users and Noise: The Magic Barrier of Recommender Systems.

[BibT_eX]

[DOI]

Proceedings of the User Modeling, Adaptation, and Personalization, 2012

Estimating the magic barrier of recommender systems: a user study.

[BibT_eX]

[DOI]

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Analyzing weighting schemes in collaborative filtering: cold start, post cold start and power users.

[BibT_eX]

[DOI]

Alan Said

Proceedings of the ACM Symposium on Applied Computing, 2012

KMulE: a framework for user-based comparison of recommender algorithms.

[BibT_eX]

[DOI]

Alan Said

Ernesto William De Luca

Proceedings of the 17th International Conference on Intelligent User Interfaces, 2012

Correlating perception-oriented aspects in user-centric recommender system evaluation.

[BibT_eX]

[DOI]

Proceedings of the Information Interaction in Context: 2012, 2012

2011

Graph quantization.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2011

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

[BibT_eX]

[DOI]

CoRR, 2011

Generalized Learning Graph Quantization.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2011

Maximum Likelihood for Gaussians on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2011

Pattern recognition in multivariate time series: dissertation proposal.

[BibT_eX]

[DOI]

Ernesto William De Luca

Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management, 2011

2010

A Maximum Common Subgraph Kernel Method for Predicting the Chromosome Aberration Test.

[BibT_eX]

[DOI]

Thomas Steger-Hartmann

Nikolaus Heinrich

J. Chem. Inf. Model., 2010

Accelerating Competitive Learning Graph Quantization

[BibT_eX]

[DOI]

CoRR, 2010

Learning Graph Quantization.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Large Sample Statistics in the Domain of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Elkan's k-Means Algorithm for Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2010

Consistent Estimator of Median and Mean Graph.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009

Structure Spaces.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2009

Elkan's k-Means for Graphs

[BibT_eX]

[DOI]

CoRR, 2009

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

[BibT_eX]

[DOI]

CoRR, 2009

Multiple alignment of contact maps.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2009

Bimal: Bipartite matching alignment for the contact map overlap problem.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2009

Algorithms for the Sample Mean of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Analysis of Images and Patterns, 13th International Conference, 2009

2008

Molecule Kernels: A Descriptor- and Alignment-Free Quantitative Structure-Activity Relationship Approach.

[BibT_eX]

[DOI]

Johannes Mohr

J. Chem. Inf. Model., 2008

On the sample mean of graphs.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2008

2007

Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem.

[BibT_eX]

[DOI]

Michael Lappe

Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2005

Structural neural learning machines.

[BibT_eX]

[DOI]

PhD thesis, 2005

Solving inexact graph isomorphism problems using neural networks.

[BibT_eX]

[DOI]

Neurocomputing, 2005

SVM learning with the Schur-Hadamard inner product for graphs.

[BibT_eX]

[DOI]

Peter Geibel

Neurocomputing, 2005

Structural Neuronal Learning Machines.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2005, 2005

2004

Discrimination networks for maximum selection.

[BibT_eX]

[DOI]

Neural Networks, 2004

Central Clustering of Attributed Graphs.

[BibT_eX]

[DOI]

Mach. Learn., 2004

Structural Perceptrons for Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2004

Learning with Neural Networks in the Domain of Graphs.

[BibT_eX]

Proceedings of the LWA 2004: Lernen - Wissensentdeckung - Adaptivität, Berlin, 4., 2004

Combining Recurrent Neural Networks and Support Vector Machines for Structural Pattern Recognition.

[BibT_eX]

[DOI]

Peter Geibel

Proceedings of the KI 2004: Advances in Artificial Intelligence, 2004

The maximum weighted clique problem and Hopfield networks.

[BibT_eX]

[DOI]

Proceedings of the 12th European Symposium on Artificial Neural Networks, 2004

Neural methods for non-standard data.

[BibT_eX]

[DOI]

Barbara Hammer

Proceedings of the 12th European Symposium on Artificial Neural Networks, 2004

SVM learning with the SH inner product.

[BibT_eX]

[DOI]

Peter Geibel

Proceedings of the 12th European Symposium on Artificial Neural Networks, 2004

2003

Automorphism Partitioning with Neural Networks.

[BibT_eX]

[DOI]

Neural Process. Lett., 2003

A k-Winner-Takes-All Classifier for Structured Data.

[BibT_eX]

[DOI]

Proceedings of the KI 2003: Advances in Artificial Intelligence, 2003

A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Neural Information Processing, 2003

A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures.

[BibT_eX]

[DOI]

Proceedings of the Graph Based Representations in Pattern Recognition, 2003

An Associative Memory for the Automorphism Group of Structures.

[BibT_eX]

[DOI]

Proceedings of the 11th European Symposium on Artificial Neural Networks, 2003

A Neural Graph Isomorphism Algorithm based on local Invariants.

[BibT_eX]

[DOI]

Proceedings of the 11th European Symposium on Artificial Neural Networks, 2003

2002

Fast Winner-Takes-All Networks for the Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the KI 2002: Advances in Artificial Intelligence, 2002

2001

Efficient Pattern Discrimination with Inhibitory WTA Nets.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks, 2001

On the short-term-memory of WTA nets.

[BibT_eX]

[DOI]