Sciweavers

12783 search results - page 2417 / 2557
» Experimenting with computing
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 5 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 5 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...
160
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 5 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
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 5 months ago
Detecting outliers using transduction and statistical testing
Outlier detection can uncover malicious behavior in fields like intrusion detection and fraud analysis. Although there has been a significant amount of work in outlier detection, ...
Daniel Barbará, Carlotta Domeniconi, James ...
« Prev « First page 2417 / 2557 Last » Next »