Sciweavers

303 search results - page 5 / 61
» Closed Set Mining of Biological Data
Sort
View
ICCS
2007
Springer
14 years 1 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 9 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
RECOMB
2006
Springer
14 years 8 months ago
Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence
Abstract. We describe and empirically evaluate machine learning methods for the prediction of zinc binding sites from protein sequences. We start by observing that a data set consi...
Sauro Menchetti, Andrea Passerini, Paolo Frasconi,...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
TKDE
2008
94views more  TKDE 2008»
13 years 7 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...