A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
From MaRDI portal
Publication:4157964
DOI10.1109/TSMC.1978.4309979zbMath0378.68048MaRDI QIDQ4157964
Publication date: 1978
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Related Items (19)
Beam search for the longest common subsequence problem ⋮ Natural discrete-event process forecasting: A decision support system ⋮ A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering ⋮ The parameterized complexity of sequence alignment and consensus ⋮ Structural nonparallel support vector machine for pattern recognition ⋮ Unnamed Item ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ On the approximation of shortest common supersequences and longest common subsequences ⋮ A multiview approach for intelligent data analysis based on data operators ⋮ Structural regularized projection twin support vector machine for data classification ⋮ A large neighborhood search heuristic for the longest common subsequence problem ⋮ GAKREM: A novel hybrid clustering algorithm ⋮ Finite automata based algorithms on subsequences and supersequences of degenerate strings ⋮ Unnamed Item ⋮ Clusters in a group: Decision making in the vector space formulation of the analytic hierarchy process ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points ⋮ Optimal matching of deformed patterns with positional influence ⋮ Computing a longest common subsequence for a set of strings ⋮ New algorithms for the LCS problem
This page was built for publication: A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
