Sciweavers

5580 search results - page 748 / 1116
» Randomized priority algorithms
Sort
View
163
Voted
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
16 years 4 months ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 4 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
FOCS
2009
IEEE
15 years 10 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna
ICDM
2009
IEEE
164views Data Mining» more  ICDM 2009»
15 years 10 months ago
iTopicModel: Information Network-Integrated Topic Modeling
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
Yizhou Sun, Jiawei Han, Jing Gao, Yintao Yu
CIKM
2009
Springer
15 years 10 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...