477 search results - page 42 / 96 » Clustering Complex Data with Group-Dependent Feature Selecti... |
106
click to vote
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
COMPSEC
2010
14 years 10 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
106
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
106
click to vote
EVOW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The increased availability of biological databases containing representations of complex objects permits access to vast amounts of data. In spite of the recent renewed in...
122
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...