252 search results - page 40 / 51 » Mining Frequent Patterns without Candidate Generation |
TCBB
2010
13 years 2 months ago
2010
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...