Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Arithmetic Cost (1)
- Bioinformatics (1)
- Biomedical signal processing (1)
- Clustering (1)
- Discrete Sine Transform (1)
-
- Fast and Efficient Algorithms (1)
- Graph (1)
- High dimensional data (1)
- High-performance computing (1)
- High-throughput genomics (1)
- Large-scale biological data analysis (1)
- Message-passing interface (1)
- Network (1)
- Non-negative matrix factorization (1)
- Recursive Algorithms (1)
- Signal Flow Graphs (1)
- Sparse and Orthogonal Factors (1)
- Text mining (1)
Articles 1 - 3 of 3
Full-Text Articles in Theory and Algorithms
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Mathematical Sciences Technical Reports (MSTR)
Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.
Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang
Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang
COBRA Preprint Series
Non-negative matrix factorization (NMF) is a widely used machine learning algorithm for dimension reduction of large-scale data. It has found successful applications in a variety of fields such as computational biology, neuroscience, natural language processing, information retrieval, image processing and speech recognition. In bioinformatics, for example, it has been used to extract patterns and profiles from genomic and text-mining data as well as in protein sequence and structure analysis. While the scientific performance of NMF is very promising in dealing with high dimensional data sets and complex data structures, its computational cost is high and sometimes could be critical for …
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Publications
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.