Mining Order-preserving Submatrices under Data Uncertainty: A Possible-world Approach and Efficient Approximation Methods
Given a data matrix , a submatrix of is an order-preserving submatrix (OPSM) if there is a permutation of the columns of , under which the entry values of each row in are strictly increasing. OPSM mining is widely used in real-life applications such as identifying coexpressed genes and finding custo...
Main Authors: | Cheng, J. (Author), Hao, X. (Author), Long, C. (Author), Ng, W. (Author), Qu, W. (Author), Wang, X. (Author), Yan, D. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Probabilistic algorithm for mining frequent sequences
by: Julija Pragarauskaitė, et al.
Published: (2010-12-01) -
A Distributed Algorithm for Fast Mining Frequent Patterns in Limited and Varying Network Bandwidth Environments
by: Chun-Cheng Lin, et al.
Published: (2019-05-01) -
A Heuristic Storage Location Assignment Based on Frequent Itemset Classes to Improve Order Picking Operations
by: Yue Li, et al.
Published: (2021-02-01) -
Novel methods for distributed and privacy-preserving data stream mining
by: Denham, Benjamin James
Published: (2019) -
Data sanitization in association rule mining based on impact factor
by: A. Telikani, et al.
Published: (2015-10-01)