Sciweavers

1601 search results - page 19 / 321
» Closed Sets for Labeled Data
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 11 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
COLING
2010
13 years 5 months ago
Boosting Relation Extraction with Limited Closed-World Knowledge
This paper presents a new approach to improving relation extraction based on minimally supervised learning. By adding some limited closed-world knowledge for confidence estimation...
Feiyu Xu, Hans Uszkoreit, Sebastian Krause, Hong L...
TKDE
2008
94views more  TKDE 2008»
13 years 10 months ago
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
Alexandre Termier, Marie-Christine Rousset, Mich&e...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
ICCV
2003
IEEE
15 years 10 days ago
Unsupervised Improvement of Visual Detectors using Co-Training
One significant challenge in the construction of visual detection systems is the acquisition of sufficient labeled data. This paper describes a new technique for training visual d...
Anat Levin, Paul A. Viola, Yoav Freund