1599 search results - page 179 / 320 » Theoretical Frameworks for Data Mining |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
IJNVO
2011
13 years 4 months ago
2011
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...