Sciweavers

KDD
2004
ACM
142views Data Mining» more  KDD 2004»
16 years 7 months ago
Meta-classification of Multi-type Cancer Gene Expression Data
Massive publicly available gene expression data consisting of different experimental conditions and microarray platforms introduce new challenges in data mining when integrating m...
Benny Y. M. Fung, Vincent T. Y. Ng
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
KDD
2004
ACM
125views Data Mining» more  KDD 2004»
16 years 7 months ago
Differential Association Rule Mining for the Study of Protein-Protein Interaction Networks
Protein-protein interactions are of great interest to biologists. A variety of high-throughput techniques have been devised, each of which leads to a separate definition of an int...
Christopher Besemann, Anne Denton, Ajay Yekkirala,...
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 7 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
KDD
2005
ACM
169views Data Mining» more  KDD 2005»
16 years 7 months ago
Analysis and Detection of Segment-Focused Attacks Against Collaborative Recommendation
Significant vulnerabilities have recently been identified in collaborative filtering recommender systems. These vulnerabilities mostly emanate from the open nature of such systems ...
Bamshad Mobasher, Robin D. Burke, Chad Williams, R...
KDD
2005
ACM
163views Data Mining» more  KDD 2005»
16 years 7 months ago
Data Sparsity Issues in the Collaborative Filtering Framework
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user effici...
Miha Grcar, Dunja Mladenic, Blaz Fortuna, Marko Gr...
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
16 years 7 months ago
Overcoming Incomplete User Models in Recommendation Systems Via an Ontology
Abstract. To make accurate recommendations, recommendation systems currently require more data about a customer than is usually available. We conjecture that the weaknesses are due...
Vincent Schickel-Zuber, Boi Faltings
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
16 years 7 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
16 years 7 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu