Sciweavers

2383 search results - page 240 / 477
» Finding Representative Set from Massive Data
Sort
View
LWA
2004
15 years 7 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
JAMIA
2010
91views more  JAMIA 2010»
15 years 24 days ago
Serving the enterprise and beyond with informatics for integrating biology and the bedside (i2b2)
Informatics for Integrating Biology and the Bedside (i2b2) is one of seven projects sponsored by the NIH Roadmap National Centers for Biomedical Computing (http://www. ncbcs.org)....
Shawn N. Murphy, Griffin Weber, Michael Mendis, Vi...
JCP
2007
118views more  JCP 2007»
15 years 5 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 6 months ago
Flint: Google-basing the Web
Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is ...
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, ...
CIKM
2008
Springer
15 years 8 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...