Sciweavers

208 search results - page 26 / 42
» Detecting Feature Interactions: How Many Components Do We Ne...
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 8 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
RAID
1999
Springer
14 years 21 days ago
Audit logs: to keep or not to keep?
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
Christopher Wee
HOTOS
1999
IEEE
14 years 22 days ago
Xenoservers: Accountable Execution of Untrusted Programs
Many networked applications could benefit from executing closer to the data or services with which they interact. By doing this they may be able to circumvent long communication l...
Dickon Reed, Ian Pratt, Paul Menage, Stephen Early...
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
13 years 6 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
RAID
1999
Springer
14 years 21 days ago
Combining Knowledge Discovery and Knowledge Engineering to Build IDSs
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
Wenke Lee, Salvatore J. Stolfo