Abstract is missing.
- Challenge for Info-plosionMasaru Kitsuregawa. 1-8 [doi]
- Machine Learning in Ecosystem InformaticsThomas G. Dietterich. 9-25 [doi]
- Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & CreativityJürgen Schmidhuber. 26-38 [doi]
- A Theory of Similarity Functions for Learning and ClusteringAvrim Blum. 39 [doi]
- A Hilbert Space Embedding for DistributionsAlexander J. Smola, Arthur Gretton, Le Song, Bernhard Schölkopf. 40-41 [doi]
- Time and Space Efficient Discovery of Maximal Geometric GraphsHiroki Arimura, Takeaki Uno, Shinichi Shimozono. 42-55 [doi]
- Iterative Reordering of Rules for Building Ensembles Without RelearningPaulo J. Azevedo, Alípio Mário Jorge. 56-67 [doi]
- On Approximating Minimum Infrequent and Maximum Frequent SetsMario Boley. 68-77 [doi]
- A Partially Dynamic Clustering Algorithm for Data Insertion and RemovalHaytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy. 78-90 [doi]
- Positivism Against Constructivism: A Network Game to Learn EpistemologyHélène Hagège, Christopher Dartnell, Jean Sallantin. 91-103 [doi]
- Learning Locally Weighted C4.4 for Class Probability EstimationLiangxiao Jiang, Harry Zhang, Dianhong Wang, Zhihua Cai. 104-115 [doi]
- User Preference Modeling from Positive Contents for Personalized RecommendationHeung-Nam Kim, Inay Ha, Jin-Guk Jung, GeunSik Jo. 116-126 [doi]
- Reducing Trials by Thinning-Out in Skill DiscoveryHayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara. 127-138 [doi]
- A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent ItemsetsShin-ichi Minato. 139-150 [doi]
- Fast NML Computation for Naive Bayes ModelsTommi Mononen, Petri Myllymäki. 151-160 [doi]
- Unsupervised Spam Detection Based on String Alienness MeasuresKazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda. 161-172 [doi]
- A Consequence Finding Approach for Full Clausal AbductionOliver Ray, Katsumi Inoue. 173-184 [doi]
- Literature-Based Discovery by an Enhanced Information Retrieval ModelKazuhiro Seki, Javed Mostafa. 185-196 [doi]
- Discovering Mentorship Information from Author Collaboration NetworksV. Suresh, Narayanan Raghupathy, B. Shekar, C. E. Veni Madhavan. 197-208 [doi]
- Active Contours as Knowledge Discovery MethodsArkadiusz Tomczyk, Piotr S. Szczepaniak, Michal Pryczek. 209-218 [doi]
- An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset MiningTakeaki Uno, Hiroki Arimura. 219-230 [doi]
- Discovering Implicit Feedbacks from Search Engine Log FilesAshok Veilumuthu, Parthasarathy Ramachandran. 231-242 [doi]
- Pharmacophore Knowledge Refinement Method in the Chemical Structure SpaceSatoshi Fujishima, Yoshimasa Takahashi, Takashi Okada. 243-247 [doi]
- An Attempt to Rebuild C. Bernard s Scientific StepsJean-Gabriel Ganascia, Bassel Habib. 248-252 [doi]
- Semantic Annotation of Data Tables Using a Domain OntologyGaëlle Hignette, Patrice Buche, Juliette Dibie-Barthélemy, Ollivier Haemmerlé. 253-258 [doi]
- Model Selection and Estimation Via Subjective User PreferencesJaakko Hollmén. 259-263 [doi]
- Detecting Concept Drift Using Statistical TestingKyosuke Nishida, Koichiro Yamauchi. 264-269 [doi]
- Towards Future Technology Projection: A Method for Extracting Capability Phrases from DocumentsRisa Nishiyama, Hironori Takeuchi, Hideo Watanabe. 270-274 [doi]
- Efficient Incremental Mining of Top-K Frequent Closed ItemsetsAndrea Pietracaprina, Fabio Vandin. 275-280 [doi]
- An Intentional Kernel Function for RNA ClassificationHiroshi Sankoh, Koichiro Doi, Akihiro Yamamoto. 281-285 [doi]
- Mining Subtrees with Frequent Occurrence of Similar SubtreesHisashi Tosaka, Atsuyoshi Nakamura, Mineichi Kudo. 286-290 [doi]
- Semantic Based Real-Time Clustering for PubMed LiteraturesRuey-Ling Yeh, Ching Liu, Ben-Chang Shia, I-Jen Chiang, Wen-Wen Yang, Ginni Hsiang-Chun Tsai. 291-295 [doi]