Sciweavers

11 search results - page 1 / 3
» A new efficient probabilistic model for mining labeled order...
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 5 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...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 5 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
ICML
2002
IEEE
14 years 5 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 2 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
13 years 10 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...