Result 1 to 20 of 76 total
Efficient semi-supervised learning on locally informative multiple graphs. (English)
Pattern Recognition 45, No. 3, 1035-1049 (2012).
1
Efficiently mining $δ$-tolerance closed frequent subgraphs. (English)
Mach. Learn. 82, No. 2, 95-121 (2011).
2
Kernels for link prediction with latent feature models. (English)
Gunopulos, Dimitrios (ed.) et al., Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5‒9, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23782-9/pbk). Lecture Notes in Computer Science 6912. Lecture Notes in Artificial Intelligence, 517-532 (2011).
3
A spectral approach to clustering numerical vectors as nodes in a network. (English)
Pattern Recognition 44, No. 2, 236-251 (2011).
4
Clustering genes with expression and beyond (English)
Wiley Interdisc. Rew.: Data Mining and Knowledge Discovery 1, No. 6, 496-511 (2011).
5
Discriminative graph embedding for label propagation (English)
IEEE Transactions on Neural Networks 22, No. 9, 1395-1405 (2011).
6
Kernels for link prediction with latent feature models (English)
ECML/PKDD (2), 517-532 (2011).
7
Metamhc: a meta approach to predict peptides binding to MHC molecules. (English)
Nucleic Acids Res. 38, No. Web-Server-Issue, 474-479 (2010).
8
Algorithms for finding a minimum repetition representation of a string. (English)
Chavez, Edgar (ed.) et al., String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16320-3/pbk). Lecture Notes in Computer Science 6393, 185-190 (2010).
9
Boosted optimization for network classification (English)
Journal of Machine Learning Research - Proceedings Track 9, 305-312 (2010).
10
Algorithms for finding a minimum repetition representation of a string (English)
SPIRE, 185-190 (2010).
11
Efficiently finding genome-wide three-way gene interactions from transcript- and genotype-data. (English)
Bioinformatics 25, No. 21, 2735-2743 (2009).
12
Enhancing MEDLINE document clustering by incorporating mesh semantic similarity. (English)
Bioinformatics 25, No. 15, 1944-1951 (2009).
13
Field independent probabilistic model for clustering multi-field documents. (English)
Inf. Process. Manage. 45, No. 5, 555-570 (2009).
14
A Markov classification model for metabolic pathways. (English)
Salzberg, Steven L. (ed.) et al., Algorithms in bioinformatics. 9th international workshop, WABI 2009, Philadelphia, PA, USA, September 12‒13, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04240-9/pbk). Lecture Notes in Computer Science 5724. Lecture Notes in Bioinformatics, 121-132 (2009).
15
Efficient probabilistic latent semantic analysis through parallelization. (English)
Lee, Gary Geunbae (ed.) et al., Information retrieval technology. 5th Asia information retrieval symposium, AIRS 2009, Sapporo, Japan, October 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04768-8/pbk). Lecture Notes in Computer Science 5839, 432-443 (2009).
16
Efficient probabilistic latent semantic analysis through parallelization (English)
AIRS, 432-443 (2009).
17
A Markov classification model for metabolic pathways (English)
WABI, 121-132 (2009).
18
Probabilistic path ranking based on adjacent pairwise coexpression for metabolic transcripts analysis. (English)
Bioinformatics 24, No. 2, 250-257 (2008).
19
A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology. (English)
ACM Trans. Knowl. Discov. Data 2, No. 1 (2008).
20
Result 1 to 20 of 76 total
Start
Contact
Print
General Help
