1314 search results - page 90 / 263 » Approximate data mining in very large relational data |
115
Voted
PKDD
2007
Springer
15 years 7 months ago
2007
Springer
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
113
click to vote
NIPS
2000
15 years 3 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
159
Voted
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking,...
138
click to vote
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
109
click to vote
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....