16596 search results - page 3038 / 3320 » Generalized Assignment Problems |
188
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
195
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
176
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
177
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
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...
140
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...