Sciweavers

11066 search results - page 1961 / 2214
» Linearity in Process Languages
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 9 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
153
Voted
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 9 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
STACS
1992
Springer
15 years 9 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
PERCOM
2010
ACM
15 years 8 months ago
AutoGait: A mobile platform that accurately estimates the distance walked
—AutoGait is a mobile platform that autonomously discovers a user’s walking profile and accurately estimates the distance walked. The discovery is made by utilizing the GPS in...
Dae-Ki Cho, Min Mun, Uichin Lee, Williams J. Kaise...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 8 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
« Prev « First page 1961 / 2214 Last » Next »