Sciweavers

3 search results - page 1 / 1
» Efficiently mining crosscutting concerns through random walk...
Sort
View
AOSD
2007
ACM
13 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 2 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
ICMCS
2009
IEEE
131views Multimedia» more  ICMCS 2009»
13 years 2 months ago
Web image mining using concept sensitive Markov stationary features
With the explosive growth of web resources, how to mine semantically relevant images efficiently becomes a challenging and necessary task. In this paper, we propose a concept sens...
Chunjie Zhang, Jing Liu, Hanqing Lu, Songde Ma