Sciweavers

20197 search results - page 3889 / 4040
» Comparing Computational Power
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 10 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 10 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 10 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 10 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2004
ACM
146views Data Mining» more  KDD 2004»
14 years 10 months ago
Using Hyperlink Features to Personalize Web Search
Personalized search has gained great popularity to improve search effectiveness in recent years. The objective of personalized search is to provide users with information tailored ...
Mehmet S. Aktas, Mehmet A. Nacar, Filippo Menczer
« Prev « First page 3889 / 4040 Last » Next »