Sciweavers

2523 search results - page 236 / 505
» Objective: In Minimum Context
Sort
View
DKE
2006
84views more  DKE 2006»
15 years 5 months ago
Mining configurable enterprise information systems
Process mining is the extraction of a process model from system logs. These logs have to meet minimum requirements, i.e. each event should refer to a case and a task. Many system ...
Monique H. Jansen-Vullers, Wil M. P. van der Aalst...
FUIN
2006
113views more  FUIN 2006»
15 years 5 months ago
Adaptive Merging of Prioritized Knowledge Bases
Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these ...
Weiru Liu, Guilin Qi, David A. Bell
CORR
2007
Springer
129views Education» more  CORR 2007»
15 years 5 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter
KAIS
2006
164views more  KAIS 2006»
15 years 5 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
PAMI
2006
164views more  PAMI 2006»
15 years 5 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero