977 search results - page 140 / 196 » An Algebraic Approach to Data Mining: Some Examples |
186
click to vote
FMOODS
2008
15 years 7 months ago
2008
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...
196
click to vote
LFCS
2009
Springer
16 years 18 days ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
190
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
150
click to vote
KDD
2005
ACM
15 years 11 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
170
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...