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...
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...
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 ...
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
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...