Sciweavers

557 search results - page 22 / 112
» A Method of Measuring Term Representativeness - Baseline Met...
Sort
View
WWW
2009
ACM
14 years 22 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, ...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
CSIE
2009
IEEE
14 years 2 months ago
Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
Mesfin Sileshi, Björn Gambäck
IMC
2010
ACM
13 years 6 months ago
Measurement of loss pairs in network paths
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...
Edmond W. W. Chan, Xiapu Luo, Weichao Li, Waiting ...
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...