Sciweavers

Share
1659 search results - page 1 / 332
» Closed Sets for Labeled Data
Sort
View
JMLR
2008
117views more  JMLR 2008»
9 years 5 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
IPL
2008
95views more  IPL 2008»
9 years 5 months ago
Optimal point removal in closed-2PM labeling
An optimal labeling where labels are disjoint axis-parallel equal-size squares is called 2PM labeling if the labels have maximum length each attached to its corresponding point on...
Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
9 years 4 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...
ICCS
2007
Springer
10 years 1 days 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
2006
IEEE
222views Database» more  ICDE 2006»
10 years 7 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
books