Mining contrast subspaces
Publication
, Conference
Duan, L; Tang, G; Pei, J; Bailey, J; Dong, G; Campbell, A; Tang, C
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 2014
In this paper, we tackle a novel problem of mining contrast subspaces. Given a set of multidimensional objects in two classes C+ and C - and a query object o, we want to find top-k subspaces S that maximize the ratio of likelihood of o in C+ against that in C -. We demonstrate that this problem has important applications, and at the same time, is very challenging. It even does not allow polynomial time approximation. We present CSMiner, a mining method with various pruning techniques. CSMiner is substantially faster than the baseline method. Our experimental results on real data sets verify the effectiveness and efficiency of our method. © 2014 Springer International Publishing.
Duke Scholars
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 2014
Volume
8443 LNAI
Issue
PART 1
Start / End Page
249 / 260
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Duan, L., Tang, G., Pei, J., Bailey, J., Dong, G., Campbell, A., & Tang, C. (2014). Mining contrast subspaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8443 LNAI, pp. 249–260). https://doi.org/10.1007/978-3-319-06608-0_21
Duan, L., G. Tang, J. Pei, J. Bailey, G. Dong, A. Campbell, and C. Tang. “Mining contrast subspaces.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8443 LNAI:249–60, 2014. https://doi.org/10.1007/978-3-319-06608-0_21.
Duan L, Tang G, Pei J, Bailey J, Dong G, Campbell A, et al. Mining contrast subspaces. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2014. p. 249–60.
Duan, L., et al. “Mining contrast subspaces.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8443 LNAI, no. PART 1, 2014, pp. 249–60. Scopus, doi:10.1007/978-3-319-06608-0_21.
Duan L, Tang G, Pei J, Bailey J, Dong G, Campbell A, Tang C. Mining contrast subspaces. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2014. p. 249–260.
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 2014
Volume
8443 LNAI
Issue
PART 1
Start / End Page
249 / 260
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences