Sciweavers

6413 search results - page 142 / 1283
» Classes of cycle bases
Sort
View
ICSM
2009
IEEE
15 years 4 months ago
Decomposing object-oriented class modules using an agglomerative clustering technique
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Furthermore, developers do not usually retain a good design in favor of adding...
Marios Fokaefs, Nikolaos Tsantalis, Alexander Chat...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 7 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
ASM
2003
ASM
15 years 11 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
AAAI
2006
15 years 8 months ago
On Multi-Class Cost-Sensitive Learning
Rescaling is possibly the most popular approach to cost-sensitive learning. This approach works by rescaling the classes according to their costs, and it can be realized in differ...
Zhi-Hua Zhou, Xu-Ying Liu
JMLR
2012
13 years 9 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu