A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
From MaRDI portal
Publication:4157964
Cited in
(19)- A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering
- A large neighborhood search heuristic for the longest common subsequence problem
- Clusters in a group: Decision making in the vector space formulation of the analytic hierarchy process
- The parameterized complexity of sequence alignment and consensus
- Beam search for the longest common subsequence problem
- A new practical linear space algorithm for the longest common subsequence problem
- GAKREM: A novel hybrid clustering algorithm
- Optimal matching of deformed patterns with positional influence
- Structural nonparallel support vector machine for pattern recognition
- Computing a longest common subsequence for a set of strings
- A multiview approach for intelligent data analysis based on data operators
- A survey of neighborhood construction algorithms for clustering and classifying data points
- On the approximation of shortest common supersequences and longest common subsequences
- Structural regularized projection twin support vector machine for data classification
- New algorithms for the LCS problem
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Natural discrete-event process forecasting: A decision support system
- scientific article; zbMATH DE number 7758340 (Why is no real title available?)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
This page was built for publication: A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157964)
