Sciweavers

436 search results - page 64 / 88
» Automatic Subspace Clustering of High Dimensional Data for D...
Sort
View
PPOPP
2010
ACM
14 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 11 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 7 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 3 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
KDD
2010
ACM
208views Data Mining» more  KDD 2010»
13 years 7 months ago
Towards mobility-based clustering
Identifying hot spots of moving vehicles in an urban area is essential to many smart city applications. The practical research on hot spots in smart city presents many unique feat...
Siyuan Liu, Yunhuai Liu, Lionel M. Ni, Jianping Fa...