1314 search results - page 115 / 263 » Approximate data mining in very large relational data |
168
Voted
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
143
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
126
Voted
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...
123
Voted
CAISE
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Industry is increasingly demanding IT support for large engineering processes, i.e., process structures consisting of hundreds up to thousands of processes. Developing a ...
141
click to vote
JMLR
2010
14 years 8 months ago
2010
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...