ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Multi-instance learning by treating instances as non-I.I.D. samples
Full text PdfPdf (841 KB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages: 1249-1256  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Zhi-Hua Zhou  Nanjing University, Nanjing, China
Yu-Yin Sun  Nanjing University, Nanjing, China
Yu-Feng Li  Nanjing University, Nanjing, China
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 79,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553534
What is a DOI?

ABSTRACT

Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely independent in real tasks, and a better performance can be expected if the instances are treated in an non-i.i.d. way that exploits relations among instances. In this paper, we propose two simple yet effective methods. In the first method, we explicitly map every bag to an undirected graph and design a graph kernel for distinguishing the positive and negative bags. In the second method, we implicitly construct graphs by deriving affinity matrices and propose an efficient graph kernel considering the clique information. The effectiveness of the proposed methods are validated by experiments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Andrews, S., Tsochantaridis, I., & Hofmann, T. (2003). Support vector machines for multiple-instance learning. In Adv. Neural Inf. Process. Syst. 15, 561--568. Cambridge, MA: MIT Press.
 
3
Auer, P., & Ortner, R. (2004). A boosting approach to multiple instance learning. Proc. 15th Eur. Conf. Mach. Learn. (pp. 63--74).
4
 
5
 
6
 
7
8
 
9
 
10
Csurka, G., Bray, C., Dance, C., & Fan, L. (2004). Visual categorization with bags of keypoints. ECCV Workshop on Statistical Learning in Computer Vision (pp. 59--74).
 
11
 
12
Fung, G., Dundar, M., Krishnappuram, B., & Rao, R. B. (2007). Multiple instance learning for computer aided diagnosis. In Adv. Neural Inf. Process. Syst. 19, 425--432. Cambridge, MA: MIT Press.
13
 
14
 
15
Kwok, J. T., & Cheung, P.-M. (2007). Marginalized multi-instance kernels. Proc. 20th Intl. J. Conf. Artif. Intell. (pp. 901--906).
 
16
 
17
McGovern, A., & Jensen, D. (2003). Identifying predictive structures in relational data using multiple instance learning. Proc. 20th Intl. Conf. Mach. Learn. (pp. 528--535).
 
18
Neuhaus, M., & Bunke, H. (2007). A quadratic programming approach to the graph edit distance problem. Proc. 6th IAPR Workshop on Graph-based Represent. in Patt. Recogn. (pp. 92--102).
19
20
 
21
 
22
Ruffo, G. (2000). Learning single and multiple instance decision trees for computer security applications. Doctoral dissertation, CS Dept., Univ. Turin, Torino, Italy.
 
23
Scott, S. D., Zhang, J., & Brown, J. (2003). On generalized multiple-instance learning (Technical Report UNL-CSE-2003-5). CS Dept., Univ. Nebraska, Lincoln, NE.
 
24
Settles, B., Craven, M., & Ray, S. (2008). Multiple-instance active learning. In Adv. Neural Inf. Process. Syst. 20, 1289--1296. Cambridge, MA: MIT Press.
25
 
26
Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319--2323.
 
27
Viola, P., Platt, J., & Zhang, C. (2006). Multiple instance boosting for object detection. In Adv. Neural Inf. Process. Syst. 18, 1419--1426. Cambridge, MA: MIT Press.
28
 
29
 
30
Weidmann, N., Frank, E., & Pfahringer, B. (2003). A two-level learning method for generalized multi-instance problem. Proc. 14th Eur. Conf. Mach. Learn. (pp. 468--479).
 
31
Xu, X., & Frank, E. (2004). Logistic regression and boosting for labeled bags of instances. Proc. 8th Pac.-Asia Conf. Knowl. Discov. Data Min. (pp. 272--281).
 
32
Zhang, C., & Viola, P. (2008). Multiple-instance pruning for learning efficient cascade detectors. In Adv. Neural Inf. Process. Syst. 20, 1681--1688. Cambridge, MA: MIT Press.
 
33
 
34
Zhang, Q., & Goldman, S. A. (2002). EM-DD: An improved multi-instance learning technique. In Adv. Neural Inf. Process. Syst. 14, 1073--1080. Cambridge, MA: MIT Press.
 
35
36
 
37
Zhou, Z.-H., & Zhang, M.-L. (2007). Multi-instance multi-label learning with application to scene classification. In Adv. Neural Inf. Process. Syst. 19, 1609--1616. Cambridge, MA: MIT Press.

Collaborative Colleagues:
Zhi-Hua Zhou: colleagues
Yu-Yin Sun: colleagues
Yu-Feng Li: colleagues