1601 search results - page 1 / 321 » Closed Sets for Labeled Data |
JMLR
2008
13 years 4 months ago
2008
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 ...
IPL
2008
13 years 4 months ago
2008
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...
ML
2010
ACM
13 years 3 months ago
2010
ACM
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 ...
ICCS
2007
Springer
13 years 10 months ago
2007
Springer
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...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
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...