Sciweavers

1314 search results - page 204 / 263
» Approximate data mining in very large relational data
Sort
View
ICCBR
2001
Springer
15 years 8 months ago
A Fuzzy-Rough Approach for Case Base Maintenance
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...
Guoqing Cao, Simon C. K. Shiu, Xizhao Wang
EDBT
2009
ACM
117views Database» more  EDBT 2009»
15 years 7 months ago
Parsimonious temporal aggregation
Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instan...
Juozas Gordevicius, Johann Gamper, Michael H. B&ou...
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
13 years 12 months ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 8 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 8 months ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang