Search Results for author:
Found 8 papers, 1 papers with code
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations
In this paper, we study the problem of visualizing \emph{a given clustering} of overlapping clusters in bipartite graphs and the related problem of visualizing Boolean Matrix Factorizations.
Finding Rule-Interpretable Non-Negative Data Representation
Scientists performing research in the fields of biology, medicine and pharmacy often prefer NMF over other dimensionality reduction approaches (such as PCA) because the non-negativity of the approach naturally fits the characteristics of the domain problem and its result is easier to analyze and understand.
Biclustering and Boolean Matrix Factorization in Data Streams
We provide an algorithm that, after one pass over the stream, recovers the set of clusters on the right side of the graph using sublinear space; to the best of our knowledge, this is the first algorithm with this property.
Recent Developments in Boolean Matrix Factorization
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra.
Boolean matrix factorization meets consecutive ones property
In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive ones property (OBMF).
Hybrid ASP-based Approach to Pattern Mining
We present a hybrid approach for itemset, sequence and graph mining which exploits dedicated highly optimized mining systems to detect frequent patterns and then filters the results using declarative ASP.
Latitude: A Model for Mixed Linear-Tropical Matrix Factorization
We present an algorithm for our novel matrix factorization.
Algorithms for Approximate Subtropical Matrix Factorization
In this paper we concentrate on the use of matrix factorizations for finding patterns from the data.
