Sciweavers

877 search results - page 105 / 176
» Structural Cut Elimination
Sort
View
FIMI
2004
212views Data Mining» more  FIMI 2004»
13 years 9 months ago
A Space Optimization for FP-Growth
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
Eray Özkural, Cevdet Aykanat
ECIS
2001
13 years 9 months ago
Overcoming Online Booking Barriers with a Software Agent Approach
Through online self-booking travel sites on the Web, consumers are offered great opportunities for convenient and inexpensive travel bookings. Nevertheless, they face certain prob...
Bill Anckar, Svante Olofsson, Pirkko Walden
NIPS
2004
13 years 9 months ago
Self-Tuning Spectral Clustering
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
Lihi Zelnik-Manor, Pietro Perona
IJCAI
2003
13 years 9 months ago
Inductive Learning in Less Than One Sequential Data Scan
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
Wei Fan, Haixun Wang, Philip S. Yu, Shaw-hwa Lo
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 9 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson