Sciweavers

1060 search results - page 21 / 212
» On the Discovery of Random Trees
Sort
View
ECML
2006
Springer
15 years 1 months ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting
ICTAI
2006
IEEE
15 years 3 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
14 years 10 months ago
Destruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
James Allen Fill, Nevin Kapur, Alois Panholzer
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 2 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
CIMCA
2006
IEEE
15 years 4 months ago
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
Mohamed Bakhouya, Jaafar Gaber