Sciweavers

645 search results - page 42 / 129
» A Data Mining Address Book
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 10 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
ICCV
2009
IEEE
6637views Computer Vision» more  ICCV 2009»
15 years 2 months ago
A Markov Clustering Topic Model for Mining Behaviour in Video
This paper addresses the problem of fully automated mining of public space video data. A novel Markov Clustering Topic Model (MCTM) is introduced which builds on existing Dynami...
Timothy Hospedales, Shaogang Gong, Tao Xiang
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 years 3 months ago
Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
Ruoming Jin, Gagan Agrawal
IUI
2011
ACM
13 years 20 days ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye