Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Aggregation of partial ordinal rankings: an interval goal programming approach
Computers and Operations Research
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth
Proceedings of the 17th International Conference on Data Engineering
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Efficient similarity search and classification via rank aggregation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Text classification using string kernels
The Journal of Machine Learning Research
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Combinatorial Representations of Token Sequences
Journal of Classification
Nearest Neighbors by Neighborhood Counting
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Introduction to Copulas (Springer Series in Statistics)
An Introduction to Copulas (Springer Series in Statistics)
Methodologies and Algorithms for Group-Rankings Decision
Management Science
Consensus and dissention: A measure of ordinal dispersion
International Journal of Approximate Reasoning
A Novel Algorithm for Counting All Common Subsequences
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Search structures and algorithms for personalized ranking
Information Sciences: an International Journal
Bioinformatics: Problem Solving Paradigms
Bioinformatics: Problem Solving Paradigms
Algorithms for subsequence combinatorics
Theoretical Computer Science
On the similarity metric and the distance metric
Theoretical Computer Science
Journal of Artificial Intelligence Research
Pattern Recognition Letters
Information Sciences: an International Journal
Testing noisy numerical data for monotonic association
Information Sciences: an International Journal
Distance-based consensus models for fuzzy and multiplicative preference relations
Information Sciences: an International Journal
Consensus model for large-scale group decision support in IT services management
Intelligent Decision Technologies - IT Service Management and Engineering: An Intelligent Decision-Making Support Systems Approach
Hi-index | 0.07 |
This paper deals with the measurement of concordance and the construction of consensus in preference data, either in the form of preference rankings or in the form of response distributions with Likert-items. We propose a set of axioms of concordance in preference orderings and a new class of concordance measures. The measures outperform classic measures like Kendall's @t and W and Spearman's @r in sensitivity and apply to large sets of orderings instead of just to pairs of orderings. For sets of N orderings of n items, we present very efficient and flexible algorithms that have a time complexity of only O(Nn^2). Remarkably, the algorithms also allow for fast calculation of all longest common subsequences of the full set of orderings. We experimentally demonstrate the performance of the algorithms. A new and simple measure for assessing concordance on Likert-items is proposed.