Sciweavers

2277 search results - page 126 / 456
» Clustering by pattern similarity in large data sets
Sort
View
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
15 years 8 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
ICDCS
2000
IEEE
15 years 11 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
INFOVIS
2000
IEEE
15 years 11 months ago
Visualizing Sequential Patterns for Text Mining
A sequential pattern in data mining is a finite series of elements such as A → B → C → D where A, B, C, and D are elements of the same domain. The mining of sequential patte...
Pak Chung Wong, Wendy Cowley, Harlan Foote, Elizab...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 6 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 10 months ago
Reporting Flock Patterns
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
Marc Benkert, Joachim Gudmundsson, Florian Hü...