Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Software is a ubiquitous component of our daily life. We often depend on the correct working of software systems. Due to the difficulty and complexity of software systems, bugs an...
David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo,...
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...
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...
Victor S. Sheng, Foster J. Provost, Panagiotis G. ...
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...