Sciweavers

373 search results - page 11 / 75
» Identifying graphs from noisy and incomplete data
Sort
View
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
13 years 9 months ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 2 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
ISSTA
2009
ACM
14 years 2 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
ECML
1994
Springer
13 years 11 months ago
Estimating Attributes: Analysis and Extensions of RELIEF
In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendel...
Igor Kononenko
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 9 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter