Sciweavers

103 search results - page 12 / 21
» Pattern avoidance in binary trees
Sort
View
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 11 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 2 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
IBPRIA
2003
Springer
14 years 3 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
ISAAC
2003
Springer
70views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Settling the Intractability of Multiple Alignment
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Isaac Elias
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...