Sciweavers

5829 search results - page 925 / 1166
» The Practice of Cluster Analysis
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
DFN
2003
15 years 8 months ago
High-Efficient Intrusion Detection Infrastructure
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
Thomas Holz, Michael Meier, Hartmut König
SDM
2004
SIAM
165views Data Mining» more  SDM 2004»
15 years 8 months ago
Visualizing RFM Segmentation
Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and imp...
Ron Kohavi, Rajesh Parekh
MI
1993
15 years 8 months ago
Putting knowledge rich plan representations to use
AI planning research is now maturing and nding practical application in the commercial, industrial, engineering and defence sectors. This has led to a rapid expansion in the last ...
Austin Tate
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe