Sciweavers

1458 search results - page 98 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 8 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ISMIS
1999
Springer
15 years 10 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
DEBU
2010
88views more  DEBU 2010»
15 years 6 months ago
SECONDO: A Platform for Moving Objects Database Research and for Publishing and Integrating Research Implementations
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
Ralf Hartmut Güting, Thomas Behr, Christian D...
CSDA
2006
83views more  CSDA 2006»
15 years 6 months ago
Linear grouping using orthogonal regression
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
Stefan Van Aelst, Xiaogang Wang, Ruben H. Zamar, R...
ESORICS
2007
Springer
15 years 10 months ago
Pragmatic XML Access Control Using Off-the-Shelf RDBMS
As the XML model gets more popular, new needs arise to specify access control within XML model. Various XML access control models and enforcement methods have been proposed recentl...
Bo Luo, Dongwon Lee, Peng Liu