MLG
2007
Springer
14 years 5 months ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
MLG
2007
Springer
14 years 5 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
MLG
2007
Springer
14 years 5 months ago
2007
Springer
We introduce a framework for an empirical evaluation of probabilistic logic languages and systems.
MLG
2007
Springer
14 years 5 months ago
2007
Springer
MLG
2007
Springer
14 years 5 months ago
2007
Springer
MLG
2007
Springer
14 years 5 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
MLG
2007
Springer
14 years 5 months ago
2007
Springer
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no la...
MLDM
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...
MLDM
2007
Springer
14 years 5 months ago
2007
Springer
A Classification Association Rule (CAR), a common type of mined knowledge in Data Mining, describes an implicative co-occurring relationship between a set of binary-valued data-att...
MLDM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In the biometric field, different experts are combined to improve the system reliability, as in many application the performance attained by individual experts (i.e., d...