255
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
248
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
254
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
224
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
We address skyline and top-k processing in web interaction scenarios. We model the problem space based on game theory principles and present new algorithms and heuristics to reali...
250
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Ordinary people have access to unprecedented volumes of information today. Researchers in the fields of information management (IM) and human-computer interaction (HCI) are reacti...
229
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
The suitability of Peer-to-Peer (P2P) approaches for fulltext web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retri...
264
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
232
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...