GRAPH STRUCTURE LEARNING FOR TASK ORDERING

Yiming Yang, Abhimanyu Lad, Henry Shu, Bryan Kisiel, Chad Cumby, Rayid Ghani, Katharina Probst

2009

Abstract

In many practical applications, multiple interrelated tasks must be accomplished sequentially through user interaction with retrieval, classification and recommendation systems. The ordering of the tasks may have a significant impact on the overall utility (or performance) of the systems; hence optimal ordering of tasks is desirable. However, manual specification of optimal ordering is often difficult when task dependencies are complex, and exhaustive search for the optimal order is computationally intractable when the number of tasks is large. We propose a novel approach to this problem by using a directed graph to represent partial-order preferences among task pairs, and using link analysis (HITS and PageRank) over the graph as a heuristic to order tasks based on how important they are in reinforcing and propagating the ordering preference. These strategies allow us to find near-optimal solutions with efficient computation, scalable to large applications. We conducted a comparative evaluation of the proposed approach on a form-filling application involving a large collection of business proposals from the Accenture Consulting & Technology Company, using SVM classifiers to recommend keywords, collaborators, customers, technical categories and other related fillers for multiple fields in each proposal. With the proposed approach we obtained near-optimal task orders that improved the utility of the recommendation system by 27% in macro-averaged F1, and 13% in micro-averaged F1, compared to the results obtained using arbitrarily chosen orders, and that were competitive against the best order suggested by domain experts.

References

  1. Brin, S. and Page, L. The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th World-Wide Web Conference, (1998)
  2. Caruana, R. and Niculescu-Mizil, A. An empirical comparison of supervised learning algorithms. Proceedings of the 23rd international conference on Machine learning (2006)
  3. Charon, I. and Hudry, O. A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Discrete Applied Mathematics (2006)
  4. Cohen, W.W. and Schapire, R.E. and Singer, Y. Learning to order things. Journal of Artificial Intelligence Research (1999)
  5. Ingwersen, P. and Jarvelin, K. Information retrieval in context: IRiX. ACM SIGIR Forum (2005)
  6. Joachims, T. Text categorization with support vector machines: Learning with many relevant features. Proceedings of ECML-98, 10th European Conference on Machine Learning (1998)
  7. Kleinberg, J. Authoritative sources in a hyperlinked environment. ACM-SIAM Symposium on Discrete Algorithms, (1998)
  8. Lewis, L. Evaluating Text Categorization, Proceedings of Speech and Natural Language Processing Workshop (1991)
  9. Ozmutlu, S. and Ozmutlu, H.C. and Spink, A. Multitasking Web searching and implications for design. Proceedings of the American Society for Information Science and Technology (2003)
  10. Reinelt G. The Linear Ordering Problem: Algorithms and Applications. Research and Exposition in Mathematics, (1985)
  11. Rijsbergen, C.J. Information Retrieval. Butterworths (1979)
  12. Yang, Y. and Lad, A. and Lao, N. and Harpale, A. and Kisiel, B. and Rogati, M. Utility-based information distillation over temporally sequenced documents. Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval (2007)
Download


Paper Citation


in Harvard Style

Yang Y., Lad A., Shu H., Kisiel B., Cumby C., Ghani R. and Probst K. (2009). GRAPH STRUCTURE LEARNING FOR TASK ORDERING . In Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8111-85-2, pages 164-169. DOI: 10.5220/0001989001640169


in Bibtex Style

@conference{iceis09,
author={Yiming Yang and Abhimanyu Lad and Henry Shu and Bryan Kisiel and Chad Cumby and Rayid Ghani and Katharina Probst},
title={GRAPH STRUCTURE LEARNING FOR TASK ORDERING},
booktitle={Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2009},
pages={164-169},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001989001640169},
isbn={978-989-8111-85-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - GRAPH STRUCTURE LEARNING FOR TASK ORDERING
SN - 978-989-8111-85-2
AU - Yang Y.
AU - Lad A.
AU - Shu H.
AU - Kisiel B.
AU - Cumby C.
AU - Ghani R.
AU - Probst K.
PY - 2009
SP - 164
EP - 169
DO - 10.5220/0001989001640169