Sciweavers

312 search results - page 48 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
ECML
2003
Springer
14 years 25 days ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
DKE
2008
159views more  DKE 2008»
13 years 7 months ago
Isolated items discarding strategy for discovering high utility itemsets
Traditional methods of association rule mining consider the appearance of an item in a transaction, whether or not it is purchased, as a binary variable. However, customers may pu...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
VLDB
2005
ACM
134views Database» more  VLDB 2005»
14 years 1 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
SIGIR
2004
ACM
14 years 1 months ago
Focused named entity recognition using machine learning
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
Li Zhang, Yue Pan, Tong Zhang
ICC
2007
IEEE
110views Communications» more  ICC 2007»
14 years 1 months ago
Resource Optimization to Provision a Virtual Private Network Using the Hose Model
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
Monia Ghobadi, Sudhakar Ganti, Gholamali C. Shoja