Results 281 to 290 of about 2,599,171 (311)
Some of the next articles are maybe not open access.
Mining Common Patterns on Graphs
2005Finding common patterns is an important problem for several computer science subfields such as Machine Learning (ML) and Data Mining (DM). When we use graph-based representations, we need the Subgraph Isomorphism (SI) operation for finding common patterns.
Iván Olmos +2 more
openaire +2 more sources
Efficiently mining special patterns
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012One of the main tasks of KDTCM (knowledge discovery in Traditional Chinese Medicine) is discovering paired or grouped drugs in Chinese Medical Formula database. Paired or grouped drugs are special combinations of two or more kinds of drugs. They not only have strong efficacy, but also can be used to construct formula classification rules.
Zhongmei Zhou, Xuejun Wang, Guiying Pan
openaire +2 more sources
Sequential Pattern Mining with Wildcards
2010 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010Sequential pattern mining is an important research task in many domains, such as biological science. In this paper, we study the problem of mining frequent patterns from sequences with wildcards. The user can specify the gap constraints with flexibility. Given a subject sequence, a minimal support threshold and a gap constraint, we aim to find frequent
Fei Xie 0002 +6 more
openaire +1 more source
Mining mutually dependent patterns
Proceedings 2001 IEEE International Conference on Data Mining, 2002In some domains, such as isolating problems in computer networks and discovering stock market irregularities, there is more interest in patterns consisting of infrequent, but highly correlated items rather than patterns that occur frequently (as defined by minsup, the minimum support level).
Sheng Ma, Joseph L. Hellerstein
openaire +2 more sources
Mining Frequent Ordered Patterns
2005Mining frequent patterns has been studied popularly in data mining research. All of previous studies assume that items in a pattern are unordered. However, the order existing between items must be considered in some applications. In this paper, we first give the formal model of ordered patterns and discuss the problem of mining frequent ordered ...
Zhi-Hong Deng 0001 +3 more
openaire +1 more source
Mining Compressed Sequential Patterns
2006Current sequential pattern mining algorithms often produce a large number of patterns. It is difficult for a user to explore in so many patterns and get a global view of the patterns and the underlying data. In this paper, we examine the problem of how to compress a set of sequential patterns using only K SP-Features(Sequential Pattern Features).
Lei Chang +3 more
openaire +2 more sources
Efficient approach of sliding window-based high average-utility pattern mining with list structures
Knowledge-Based Systems, 2022Jerry Chun-Wei Lin, Unil Yun, Bay Vo
exaly
A Survey of Utility-Oriented Pattern Mining
IEEE Transactions on Knowledge and Data Engineering, 2021Jerry Chun-Wei Lin +2 more
exaly
NTP-Miner: Nonoverlapping Three-Way Sequential Pattern Mining
ACM Transactions on Knowledge Discovery From Data, 2022Youxi Wu +2 more
exaly
One scan based high average-utility pattern mining in static and dynamic databases
Future Generation Computer Systems, 2020Jerry Chun-Wei Lin +2 more
exaly