Volume 82, Number 1, January 2011 Special Issue on Swarm Intelligence
Volume 82, Number 2, February 2011 Special Issue on Learning and Mining with Graphs
- S. V. N. Vishwanathan, Samuel Kaski, Jennifer Neville, Stefan Wrobel:
Introduction to the special issue on mining and learning with graphs.
- Ichigaku Takigawa, Hiroshi Mamitsuka:
Efficiently mining δ-tolerance closed frequent subgraphs.
- Elisabeth Georgii, Koji Tsuda, Bernhard Schölkopf:
Multi-way set enumeration in weight tensors.
- Tianbao Yang, Yun Chi, Shenghuo Zhu, Yihong Gong, Rong Jin:
Detecting communities and their evolutions in dynamic social networks - a Bayesian approach.
- Achim Rettinger, Matthias Nickles, Volker Tresp:
Statistical relational learning of trust.
- Jie Tang, Jing Zhang, Ruoming Jin, Zi Yang, Keke Cai, Li Zhang, Zhong Su:
Topic level expertise search over heterogeneous networks.
- Ingo Thon, Niels Landwehr, Luc De Raedt:
Stochastic relational processes: Efficient inference and applications.
Volume 82, Number 3, March 2011 25th Anniversary Issue
Last update Mon May 20 18:12:58 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page
- Peter A. Flach:
The Machine Learning journal: 25 years young.
- Pat Langley:
The changing science of machine learning.
- Jacob W. Crandall, Michael A. Goodrich:
Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning.
- Werner Uwents, Gabriele Monfardini, Hendrik Blockeel, Marco Gori, Franco Scarselli:
Neural networks for relational learning: an experimental comparison.
- Alexander Clark, Christophe Costa Florêncio, Chris Watkins:
Languages as hyperplanes: grammatical inference with string kernels.
- Kai Ming Ting, Jonathan R. Wells, Swee Chuan Tan, Shyh Wei Teng, Geoffrey I. Webb:
Feature-subspace aggregating: ensembles for stable and unstable learners.
- Lihong Li, Michael L. Littman, Thomas J. Walsh, Alexander L. Strehl:
Knows what it knows: a framework for self-aware learning.
- Saher Esmeir, Shaul Markovitch:
Anytime learning of anycost classifiers.
- Jan Zahálka, Filip Zelezný:
An experimental test of Occam's razor in classification.