A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
String Pattern Discovery
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we review a series of our works concerning with the string pattern discovery. ...
Finding a good pattern which discriminates one set of strings from the other set is a critical task in knowledge discovery. ...
String pattern discovery, where one is interested in extracting patterns which characterizes a set of strings or sequential data, has attracted widespread attentions [1, 36, 13, 24, 12, 3, 4, 30] . ...
doi:10.1007/978-3-540-30215-5_1
fatcat:sascezkstffezj7jigqmylkrga
Pattern Discovery in Colored Strings
2020
Symposium on Experimental and Efficient Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of identifying patterns of interest in colored strings. A colored string is a string in which each position is colored with one of a finite set of colors. ...
We show that the number of interesting patterns is upper-bounded by 𝒪(n²) where n is the length of the string. ...
We introduce colored strings, and propose and analyze a pattern discovery problem on colored strings which corresponds to a useful simplification of pattern mining w.r.t. assertion mining. ...
doi:10.4230/lipics.sea.2020.12
dblp:conf/wea/LiptakP020
fatcat:gbmzfl6shvehrbvahz4fflrtqu
Pattern Discovery in Colored Strings
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We consider the problem of identifying patterns of interest in colored strings. A colored string is a string in which each position is colored with one of a finite set of colors. ...
We show that the number of interesting patterns is upper-bounded by O(n^2) where n is the length of the string. ...
We introduce colored strings, and propose and analyze a pattern discovery problem on colored strings which corresponds to a useful simplification of pattern mining w.r.t. assertion mining. ...
arXiv:2004.04858v1
fatcat:dcvxuqxmcrfvfhg6d4bp6cdh34
Psychological constraints on string-based methods for pattern discovery in polyphonic corpora
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This study examines whether psychologically-motivated weighting functions can improve harmonic pattern discovery algorithms. ...
Researchers often divide symbolic music corpora into contiguous sequences of n events (called n-grams) for the purposes of pattern discovery, key finding, classification, and prediction. ...
Conclusions This study demonstrates that applying psychological constraints to pattern discovery algorithms improves task performance. ...
arXiv:1807.06700v1
fatcat:plafagozpnaw5ezbkav7aovfwy
A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns
2002
Genome Informatics Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present a new approach to pattern discovery called string pattern regression, where we are given a data set that consists of a string attribute and an objective numerical attribute. ...
The problem is to find the best string pattern that divides the data set in such a way that the distribution of the numerical attribute values of the set for which the pattern matches the string attribute ...
Discussion We defined a new approach to string pattern discovery and presented an efficient branch-and-bound algorithm for solving the problem exactly. ...
doi:10.11234/gi1990.13.3
fatcat:tp3ji5byazhcdobj3gtd2uapom
A string pattern regression algorithm and its application to pattern discovery in long introns
2002
Genome Informatics Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a new approach to pattern discovery called string pattern regression, where we are given a data set that consists of a string attribute and an objective numerical attribute. ...
The problem is to find the best string pattern that divides the data set in such a way that the distribution of the numerical attribute values of the set for which the pattern matches the string attribute ...
Discussion We defined a new approach to string pattern discovery and presented an efficient branch-and-bound algorithm for solving the problem exactly. ...
pmid:14571369
fatcat:w5ept5uuofbx7olykqph3lyaae
Automatic information extraction from semi-structured Web pages by pattern discovery
2003
Decision Support Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
IEPAD applies several pattern discovery techniques, including PAT-trees, multiple string alignments and pattern matching algorithms. ...
In this paper, we introduce IEPAD (an acronym for Information Extraction based on PAttern Discovery), a system that discovers extraction patterns from Web pages without user-labeled examples. ...
Fig. 3 gives the flowchart of the pattern discovery process. Given a Web page, the token encoder will tokenize the page into a string of abstract representations, referred to as a token string. ...
doi:10.1016/s0167-9236(02)00100-8
fatcat:x6kfrckenfcbjdyssnabz3xmka
A framework for representing navigational patterns as full temporal objects
2004
ACM SIGecom Exchanges
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Most existing works on navigational pattern-discovery give little consideration to the effects of time (or temporal trends) on navigational patterns. ...
To achieve full temporal representation, this paper proposes a navigational pattern-discovery technique that is not based on pre-defined thresholds. ...
Most of the research works on navigational pattern discovery, however, are in the area of web usage mining. ...
doi:10.1145/1120687.1120691
fatcat:wh74nie7e5cnzb4skcxdbl4fju
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. ...
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. ...
survey [21] for pattern discovery algorithms). ...
doi:10.1007/978-3-642-16184-1_10
fatcat:7c7runj54nc4haslxzxu7fmnkq
Regulatory Sequence Analysis Tools
2003
Nucleic Acids Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Alternative formats are supported for the representation of regulatory motifs (strings or position-specific scoring matrices) and several algorithms are proposed for pattern discovery. ...
These tools include sequence retrieval, pattern discovery, pattern matching, genome-scale pattern matching, feature-map drawing, random sequence generation and other utilities. ...
Pattern discovery Given a set of co-regulated genes, pattern discovery programs can be used to detect over-represented motifs in their upstream regions. ...
doi:10.1093/nar/gkg567
pmid:12824373
pmcid:PMC168973
fatcat:664jsrokcbcffkirtsydp6u46m
Motif discovery in spatial trajectories using grammar inference
2013
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
represents a repeated pattern, and from these rules, additional machine processing (e.g., motif discovery) can be performed. ...
Since mSEQUITUR matches the similar contexts of these patterns and captures the potential merge candidates, the combination of all three related rules results in more discoveries of the expected pattern ...
doi:10.1145/2505515.2507820
dblp:conf/cikm/OatesB0CFG13
fatcat:ygz3rh5yzvhxjderf6hddj6kxy
Finding Repeated Patterns in Music: State of Knowledge, Challenges, Perspectives
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper discusses the current state of knowledge on musical pattern discovery. Various studies propose computational methods to find repeated musical patterns. ...
Our detailed review of these studies reveals important challenges in musical pattern discovery research: di↵erent methods have not yet been directly compared, and the influence of music representation ...
Are there specific advantages of a string-based over a geometric approach for a given pattern discovery task, or vice versa? ...
doi:10.1007/978-3-319-12976-1_18
fatcat:pc7lan4jbjfzjlnp5d6lnzhih4
Structure motif discovery and mining the PDB
2002
Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. ...
The residues in a pattern need not be close in the protein's sequence. The work described in this paper builds on an earlier reported algorithm for motif discovery. ...
Firstly, in SPratt the discovery of neighbour string patterns was performed using the tool Pratt (Jonassen et al., 1995; Jonassen, 1997) . ...
doi:10.1093/bioinformatics/18.2.362
pmid:11847094
fatcat:e46qzaxplrfyfgwomjvtnf7utm
More Speed and More Pattern Variations for Knowledge Discovery System BONSAI
2001
Genome Informatics Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Definition 1 (Substring Pattern) A substring pattern is a string w ∈ Σ * . A substring pattern matches a given string t ∈ Σ * if w is a substring of t. ...
Definition 2 (Subsequence Pattern) A subsequence pattern is a string w ∈ Σ * . ...
doi:10.11234/gi1990.12.454
fatcat:lqu54lhpivg7pbp5liu46uoaga
Visualizing Variable-Length Time Series Motifs
[chapter]
2012
Proceedings of the 2012 SIAM International Conference on Data Mining
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The problem of time series motif discovery has received a lot of attention from researchers in the past decade. ...
We demonstrate that grammar induction in time series can effectively identify repeated patterns without prior knowledge of their lengths. ...
hierarchical structures and patterns of the whole data -something that cannot be achieved by existing motif discovery or sequential pattern discovery algorithms. ...
doi:10.1137/1.9781611972825.77
dblp:conf/sdm/LiLO12
fatcat:briw6g5lrbddder5xyr7wqyn4m
« Previous
Showing results 1 — 15 out of 95,213 results