2989 search results - page 372 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
188
click to vote
PAKDD
2007
ACM
16 years 16 days ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
155
click to vote
IJCNN
2006
IEEE
16 years 13 days ago
2006
IEEE
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
170
Voted
EPIA
2005
Springer
15 years 12 months ago
2005
Springer
We present a general-purpose framework for updating a robot’s observation model within the context of planning and execution. Traditional plan execution relies on monitoring plan...
177
click to vote
DAWAK
2004
Springer
15 years 10 months ago
2004
Springer
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
140
click to vote
ETRICS
2006
15 years 10 months ago
2006
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...