11231 search results - page 238 / 2247 » Digging for Data Structures |
210
click to vote
MKM
2004
Springer
15 years 12 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
173
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
193
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
188
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
176
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...