Sciweavers

3651 search results - page 260 / 731
» Data Mining for Security Applications
Sort
View
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
16 years 7 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
ICTAI
2006
IEEE
16 years 20 days ago
Sequence Mining Without Sequences: A New Way for Privacy Preserving
During the last decade, sequential pattern mining has been the core of numerous researches. It is now possible to efficiently discover users’ behavior in various domains such a...
Stéphanie Jacquemont, François Jacqu...
TKDE
2008
128views more  TKDE 2008»
15 years 6 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
PLDI
2006
ACM
16 years 17 days ago
Precise alias analysis for static detection of web application vulnerabilities
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applica...
Nenad Jovanovic, Christopher Kruegel, Engin Kirda
NIPS
2008
15 years 8 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie