Sciweavers

1544 search results - page 65 / 309
» Data Mining and Database Systems: Where is the Intersection
Sort
View
SADM
2008
165views more  SADM 2008»
13 years 7 months ago
Global Correlation Clustering Based on the Hough Transform
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Elke Achtert, Christian Böhm, Jörn David...
DAGSTUHL
2007
13 years 9 months ago
An analytic solution to the alibi query in the bead model for moving object data
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
Bart Kuijpers, Walied Othman
SAC
2008
ACM
13 years 7 months ago
A cost-driven approach to role engineering
In recent years role-based access control (RBAC) has been spreading within organizations. However, companies still have considerable difficulty migrating to this model, due to the...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
13 years 12 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han