Sciweavers

1314 search results - page 128 / 263
» Approximate data mining in very large relational data
Sort
View
155
Voted
ICDM
2009
IEEE
151views Data Mining» more  ICDM 2009»
14 years 11 months ago
TagLearner: A P2P Classifier Learning System from Collaboratively Tagged Text Documents
The amount of text data on the Internet is growing at a very fast rate. Online text repositories for news agencies, digital libraries and other organizations currently store gigaan...
Haimonti Dutta, Xianshu Zhu, Tushar Mahule, Hillol...
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 7 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
INFOCOM
2003
IEEE
15 years 7 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
103
Voted
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
14 years 11 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
WSDM
2009
ACM
136views Data Mining» more  WSDM 2009»
15 years 8 months ago
Mining common topics from multiple asynchronous text streams
Text streams are becoming more and more ubiquitous, in the forms of news feeds, weblog archives and so on, which result in a large volume of data. An effective way to explore the...
Xiang Wang 0002, Kai Zhang, Xiaoming Jin, Dou Shen