Sciweavers

12863 search results - page 288 / 2573
» Dynamic Data Mining
Sort
View
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
16 years 1 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
16 years 29 days ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
ICDM
2010
IEEE
193views Data Mining» more  ICDM 2010»
15 years 4 months ago
Supervised Link Prediction Using Multiple Sources
Link prediction is a fundamental problem in social network analysis and modern-day commercial applications such as Facebook and Myspace. Most existing research approaches this pro...
Zhengdong Lu, Berkant Savas, Wei Tang, Inderjit S....
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
15 years 4 months ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
15 years 1 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke