2512 search results - page 191 / 503 » Learning from Highly Structured Data by Decomposition |
115
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
135
click to vote
TMC
2008
15 years 4 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
121
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
158
click to vote
DMIN
2007
15 years 5 months ago
2007
— One way to handle data mining problems where class prior probabilities and/or misclassification costs between classes are highly unequal is to resample the data until a new, d...
139
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...