Sciweavers

2308 search results - page 239 / 462
» A Perspective on Databases and Data Mining
Sort
View
ACMSE
2010
ACM
15 years 4 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
16 years 7 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
16 years 7 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
ECML
1997
Springer
15 years 10 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
DAWAK
2004
Springer
16 years 19 hour ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan