HIDING SEQUENTIAL AND SPATIOTEMPORAL PATTERNS
HIDING SEQUENTIAL AND SPATIOTEMPORAL PATTERNS
Abstract:
The
process of discovering relevant patterns holding in a database was first
indicated as a threat to database security by O’Leary in. Since then, many different approaches for
knowledge hiding have emerged over the years, mainly in the context of association
rules and frequent item sets mining. Following many real-world data and
application demands, in this paper, we shift the problem of knowledge hiding to
contexts where both the data and the extracted knowledge have a sequential
structure. We define the problem of hiding sequential patterns and show its
NP-hardness. Thus, we devise heuristics and a polynomial sanitization
algorithm. Starting from this framework, we specialize it to the more complex case
of spatiotemporal patterns extracted from moving objects databases. Finally, we
discuss a possible kind of attack to our model, which exploits the knowledge of
the underlying road network, and enhance our model to protect from this kind of
attack. An exhaustive experiential analysis on real-world data sets shows the effectiveness
of our proposal.
Existing System:
v
The
process of discovering relevant patterns holding in a database was first
indicated as a threat to database security by O’Leary
v
The
Existing System have the problem of knowledge hiding, where both the data and the
extracted knowledge have a sequential structure.
v
Knowledge
hiding is usually obtained by sanitizing the database in such a way that the
sensitive knowledge can no longer be inferred, while the original database is
changed as little as possible.
v
In
the case of biomedical data, sensitive knowledge may be represented by patterns
correlating some genetical configuration, or geographical area, with some
severe diseases: this kind of knowledge should be kept secret both for the
privacy of the patients and for avoiding excessive alarmism.
Proposed System:
v We
defined the sequence hiding problem and proved that the optimal sequence
sanitization is NP-Hard.
v
We
introduced a heuristic algorithm that aims less distortion while providing
sanitization.
v
The
algorithm is flexible in the sense that it allows a disclosure threshold and
three practical constraints (min gap, max gap, and max window) to be specified.
We discussed its extensions to sequences of item sets.
v
Using
the techniques developed for sequence hiding, we defined the novel problem of
hiding sensitive trajectory patterns.
v
The
sanitization of mobility data introduces new challenges due to the background
knowledge attacks exploiting publicly available information on road networks,
and also due to the temporal dimension in the data and in the sensitive patterns.
v
We
proposed a coarsening approach that consists in reducing the information
contained in some sensitive trajectories by suppressing some spatiotemporal
points.
KEYWORDS:
Generic Technology Keywords: Database,
User Interface, Programming
Specific Technology Keywords: C#.Net,
ASP.Net, MS SqlServer-08
Project Keywords: Presentation, Business Object, Data Access Layer
SDLC Keywords: Analysis, Design, Code, Testing, Implementation, Maintenance
SYSTEM
CONFIGURATION
HARDWARE
CONFIGURATION
|
S.NO
|
HARDWARE
|
CONFIGURATIONS
|
|
1
|
Operating System
|
Windows 2000 & XP
|
|
2
|
RAM
|
1GB
|
|
3
|
Processor (with Speed)
|
Intel
Pentium IV (3.0 GHz) and Upwards
|
|
4
|
Hard Disk Size
|
40 GB and above
|
|
5
|
Monitor
|
15’ CRT
|
SOFTWARE
CONFIGURATION
|
S.NO
|
SOFTWARE
|
CONFIGURATIONS
|
|
1
|
Platform
|
Microsoft Visual Studio
|
|
2
|
Framework
|
.Net Framework 4.0
|
|
3
|
Language
|
C#.Net
|
|
4
|
Front End
|
Asp.Net
|
|
5
|
Back End
|
SQL Server 2008
|
Categories:
0 comments:
Post a Comment