Sciweavers

14548 search results - page 2825 / 2910
» The Optimal Path-Matching Problem
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
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
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
RECOMB
2008
Springer
14 years 10 months ago
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
Cuong Than, Guohua Jin, Luay Nakhleh
« Prev « First page 2825 / 2910 Last » Next »