Sciweavers

11394 search results - page 255 / 2279
» Error-Correcting Data Structures
Sort
View
161
Voted
DAWAK
2006
Springer
15 years 7 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
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 ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 5 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
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...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
15 years 5 months ago
GraSS: Graph Structure Summarization
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...
Kristen LeFevre, Evimaria Terzi
NIPS
2004
15 years 5 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek
SOFTVIS
2010
ACM
15 years 3 months ago
Towards anomaly comprehension: using structural compression to navigate profiling call-trees
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
Shen Lin 0003, François Taïani, Thomas...