Open AccessDissertation
Statistical Learning in Multiple Instance Problems
Xin Xu
- 01 Jan 2003
TL;DR: This thesis categorizes current MI methods into a new framework, and proposes a new assumption for MI learning, called the “collective assumption”, which states that “An example is positive if at least one of its instances is positive and negative otherwise”.
read more
Abstract: Multiple instance (MI) learning is a relatively new topic in machine learning. It is concerned with supervised learning but differs from normal supervised learning in two points: (1) it has multiple instances in an example (and there is only one instance in an example in standard supervised learning), and (2) only one class label is observable for all the instances in an example (whereas each instance has its own class label in normal supervised learning). In MI learning there is a common assumption regarding the relationship between the class label of an example and the “unobservable” class labels of the instances inside it. This assumption, which is called the “MI assumption” in this thesis, states that “An example is positive if at least one of its instances is positive and negative otherwise”. In this thesis, we first categorize current MI methods into a new framework. According to our analysis, there are two main categories of MI methods, instancebased and metadata-based approaches. Then we propose a new assumption for MI learning, called the “collective assumption”. Although this assumption has been used in some previous MI methods, it has never been explicitly stated,1 and this is the first time that it is formally specified. Using this new assumption we develop new algorithms — more specifically two instance-based and one metadata-based methods. All of these methods build probabilistic models and thus implement statistical learning algorithms. The exact generative models underlying these methods are explicitly stated and illustrated so that one may clearly understand the situations 1As a matter of fact, for some of these methods, it is actually claimed that they use the standard MI assumption stated above.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The WEKA data mining software: an update
TL;DR: This paper provides an introduction to the WEKA workbench, reviews the history of the project, and, in light of the recent 3.6 stable release, briefly discusses what has been added since the last stable version (Weka 3.4) released in 2003.
Multiple instance classification: Review, taxonomy and comparative study
TL;DR: This work concludes that methods that extract global bag-level information show a clearly superior performance in general and permits us to establish guidelines in the design of new MIL methods.
697
A review of multi-instance learning assumptions
James R. Foulds,Eibe Frank +1 more
TL;DR: This paper aims to clarify the use of alternative MI assumptions by reviewing the work done in this area, and focuses on a relaxed view of the MI problem, where the standard MI assumption is dropped and alternative assumptions are considered instead.
Multi-instance tree learning
Hendrik Blockeel,David C. Page,Ashwin Srinivasan +2 more
- 07 Aug 2005
TL;DR: A novel algorithm for decision tree learning in the multi- instance setting as originally defined by Dietterich et al. is introduced and it is shown that the resulting system outperforms the existing multi-instance decision tree learners.
Attention-based Convolutional Neural Networks for Acoustic Scene Classification
Zhao Ren,Qiuqiang Kong,Kun Qian,Mark D. Plumbley,Björn Schuller +4 more
- 01 Jan 2018
TL;DR: A convolutional neural network model based on an attention pooling method to classify ten different acoustic scenes, participating in the IEEE AASP challenge on detection and classification of AcousticScenes and Events (DCASE 2018), which includes data from one device (subtask A) and data from three different devices (sub task B).
81
References
•Book
The Nature of Statistical Learning Theory
Vladimir Vapnik
- 01 Jan 1995
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
46K
•Book
C4.5: Programs for Machine Learning
J. Ross Quinlan
- 15 Oct 1992
TL;DR: A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
27.2K
•Book
Data Mining: Practical Machine Learning Tools and Techniques
Ian H. Witten,Eibe Frank,Mark Hall +2 more
- 25 Oct 1999
TL;DR: This highly anticipated third edition of the most acclaimed work on data mining and machine learning will teach you everything you need to know about preparing inputs, interpreting outputs, evaluating results, and the algorithmic methods at the heart of successful data mining.
25.4K
•Book
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
Trevor Hastie,Robert Tibshirani,Jerome H. Friedman +2 more
- 28 Jul 2013
TL;DR: In this paper, the authors describe the important ideas in these areas in a common conceptual framework, and the emphasis is on concepts rather than mathematics, with a liberal use of color graphics.
21.3K
Related Papers (5)
Oded Maron,Tomás Lozano-Pérez +1 more
- 01 Dec 1997
Jun Wang,Jean-Daniel Zucker +1 more
- 29 Jun 2000
Qi Zhang,Sally A. Goldman +1 more
- 03 Jan 2001