Complex objects ranking: A relational data mining approach

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1071-1077

  Ceci, Michelangelo ^a   Appice, Annalisa ^a   Loglisci, Corrado ^a   Malerba, Donato ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

probabilistic approach; ranking; relational data mining

Indexed keywords

ATTRIBUTE-VALUE PAIRS; COMPLEX OBJECTS; DATA MINING TECHNIQUES; FEATURE VECTORS; LEARNING PREFERENCES; PREFERENCE RELATION; PROBABILISTIC APPROACHES; RANKING PROBLEMS; RELATIONAL DATA MINING; RELATIONAL LEARNING; SCIENTIFIC LITERATURE;

DATA MINING;

EID: 77954699116     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774311     Document Type: Conference Paper

References (23)

1. L. Antiqueira, O. N. Oliveira, L. da Fontoura Costa, and M. das Graças Volpe Nunes. A complex network approach to text summarization. Inf. Sci., 179(5):584, 2009.
2. C. J. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. N. Hullender. Learning to rank using gradient descent. In L. D. Raedt and S. Wrobel, editors, ICML, volume 119 of ACM International Conference Proceeding Series, pages 89-96. ACM, 2005.
3. M. Ceci, M. Berardi, G. Porcelli, and D. Malerba. A data mining approach to reading order detection. In ICDAR, pages 924-928. IEEE, 2007.
4. K. Crammer and Y. Singer. Pranking with ranking. In NIPS, pages 641-647. MIT Press, 2001.
5. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Journal of Data Mining and Knowledge Discovery, 3(1):7-36, 1999.
6. O. Dekel, C. D. Manning, and Y. Singer. Log-linear models for label ranking. In NIPS. MIT Press, 2003.
7. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43-52. ACM Press, 1999.
8. S. Džeroski and N. Lavrač. Relational Data Mining. Springer, 2001.
9. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In WWW '01, pages 613-622. ACM Press, 2001.
10. Y. Freund, R. D. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
11. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. MIT Press, 2000.
12. E. Hüllermeier, J. Fürnkranz, W. Cheng, and K. Brinker. Label ranking by learning pairwise preferences. Artif. Intell., 172(16-17):1897-1916, 2008.
13. T. Kamishima and S. Akaho. Learning from order examples. In ICDM, pages 645-648. IEEE, 2002.
14. K. Kersting and Z. Xu. Learning preferences with hidden common cause relations. In ECML PKDD 09, LNAI. Springer, 2009.
15. K. Liu, E. Terzi, and T. Grandison. Manyaspects: a system for highlighting diverse concepts in documents. PVLDB, 1(2):1444-1447, 2008.
16. D. Malerba and M. Ceci. Learning to order: A relational approach. In MCD, volume 4944 of LNCS, pages 209-223, 2008.
17. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
18. G. Nagy. Twenty years of document image analysis in PAMI. IEEE Trans. Pattern Anal. Mach. Intell., 22(1):38-62, 2000.
19. C. D. Paice. Constructing literature abstracts by computer: Techniques and prospects. Inf. Process. Manage., 26(1):171-186, 1990.
20. J. A. Robinson. A machine oriented logic based on the resolution principle. Journal of the ACM, 12:23-41, 1965.
21. R. Rymon. An SE-tree based characterization of the induction problem. In ICML, pages 268-275. Morgan Kaufmann, 1993.
22. F. Sebastiani. Machine learning in automated text categorization. ACM Computing Surveys, 34(1):1-47, 2002.
23. C. Wang, F. Jing, L. Zhang, and H.-J. Zhang. Learning query-biased web page summarization. In CIKM, pages 555-562. ACM, 2007.