On the Complexity of Finding Emerging Patterns

Authors:
Lusheng Wang;Hao Zhao;Guozhu Dong;Jianping Li
Affiliations:
City University of Hong Kong;City University of Hong Kong;Wright State University;Yunnan University and City University of Hong Kong
Venue:
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - Volume 02
Year:
2004

Citing 0
Cited 2

Maximum patterns in datasets

Discrete Applied Mathematics
Optimal string mining under frequency constraints

PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful for capturing interactions among genes (or other biological entities), for capturing signature patterns for disease subtypes, and deriving potential disease treatment plans, etc. In this paper we study the complexity of finding emerging patterns (with the highest frequency). We first show that the problem is MAX SNPhard. This implies that polynomial time approximation schemes do not exist for the problem unless P = NP. We then prove that for any constant 驴