EDBT
2010
ACM
13 years 12 months ago
2010
ACM
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
PAKDD
2010
ACM
14 years 5 hour ago
2010
ACM
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
KDD
2010
ACM
14 years 7 hour ago
2010
ACM
Many real-world data mining tasks require the achievement of two distinct goals when applied to unseen data: first, to induce an accurate preference ranking, and second to give g...
KDD
2010
ACM
14 years 7 hour ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
INCDM
2010
Springer
14 years 10 hour ago
2010
Springer
Abstract. Spam is serious problem that affects email users (e.g. phishing attacks, viruses and time spent reading unwanted messages). We propose a novel spam email filtering appr...
INCDM
2010
Springer
14 years 10 hour ago
2010
Springer
Hospitals increasingly use process models for structuring their care processes. Activities performed to patients are logged to a database but these data are rarely used for managin...
KDD
1994
ACM
14 years 3 days ago
1994
ACM
VLDB
1995
ACM
14 years 4 days ago
1995
ACM
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
KDD
1995
ACM
14 years 4 days ago
1995
ACM
Eficient and efiective discovery of resource and knowledge from the Internet has become an imminent research issue, especially with the advent of the Information Super-Highway. A ...
KDD
1995
ACM
14 years 4 days ago
1995
ACM
