Sciweavers

KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 5 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
14 years 5 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
14 years 5 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 5 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 5 months ago
Visually mining and monitoring massive time series
Moments before the launch of every space vehicle, engineering discipline specialists must make a critical go/no-go decision. The cost of a false positive, allowing a launch in spi...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Jef...
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 5 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 5 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
14 years 5 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
14 years 5 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...