Sciweavers

128 search results - page 21 / 26
» On Mining Closed Sets in Multi-Relational Data
Sort
View
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
WWW
2009
ACM
14 years 9 days ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
MDM
2004
Springer
133views Communications» more  MDM 2004»
14 years 1 months ago
Cache-Miss-Initiated Prefetch in Mobile Environments
Prefetching has been widely used to improve system performance in mobile environments. Since prefetching consumes system resources, such as bandwidth and power, it is important to...
Hui Song, Guohong Cao
SDM
2007
SIAM
122views Data Mining» more  SDM 2007»
13 years 9 months ago
Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thoma...