Sciweavers

2180 search results - page 112 / 436
» Algorithms for discovering bucket orders from data
Sort
View
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
15 years 9 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
IPL
2002
125views more  IPL 2002»
15 years 4 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
WWW
2009
ACM
16 years 5 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
110
Voted
AIR
2000
91views more  AIR 2000»
15 years 4 months ago
PlanMine: Predicting Plan Failures Using Sequence Mining
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because p...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
ICML
2010
IEEE
15 years 5 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan