Sciweavers

1083 search results - page 112 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 6 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
16 years 20 days ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
15 years 7 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
JMLR
2010
117views more  JMLR 2010»
15 years 1 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 6 months ago
Data Stream Clustering: Challenges and Issues
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
Madjid Khalilian, Norwati Mustapha