Search w/in this Title for Titles All Reviews
	ACM Transactions on Knowledge Discovery from Data (TKDD) ACM Press         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-10 of 14 reviews Date Reviewed     Comparative document summarization via discriminative sentence selection Wang D., Zhu S., Li T., Gong Y.  ACM Transactions on Knowledge Discovery from Data (TKDD) 6(3): 1-18, 2012. Type: Article The main novelty of this interesting and important paper lies in the identification of what is really an under-researched problem: how to summarize the differences between documents. While document similarity and document summarization are... Feb 12 2013   Large linear classification when data cannot fit in memory Yu H., Hsieh C., Chang K., Lin C.  ACM Transactions on Knowledge Discovery from Data (TKDD) 5(4): 1-23, 2012. Type: Article Linear classification is the process of discriminating objects using linear combinations of the features (or model parameters) extracted (or estimated) from the objects. Among the various available classifiers, support vector machines (SVMs) are... Aug 10 2012   Integrating document clustering and multidocument summarization Wang D., Zhu S., Li T., Chi Y., Gong Y.  ACM Transactions on Knowledge Discovery from Data (TKDD) 5(3): 1-26, 2011. Type: Article Future information retrieval systems require effective document grouping and condensation algorithms to aid users in the interpretation of retrieved documents. The design of such algorithms for generating meaningful and interpretable document... Feb 28 2012   Can the utility of anonymized data be used for privacy breaches? Wong R., Fu A., Wang K., Yu P., Pei J.  ACM Transactions on Knowledge Discovery from Data (TKDD) 5(3): 1-24, 2011. Type: Article Database and information security specialists should remain cognizant of the loophole exploitation of logical patterns in published data. Public data and background information on people are potent weapons that some agents may use to breach... Feb 17 2012   Fast algorithms for approximating the singular value decomposition Menon A., Elkan C.  ACM Transactions on Knowledge Discovery from Data (TKDD) 5(2): 1-36, 2011. Type: Article In this paper, the authors address generating a low-rank approximation to an existing matrix, which is close to the original matrix in some sense. Such approximations arise in a number of application areas, including semantic analysis, data... May 6 2011   A combination approach to Web user profiling Tang J., Yao L., Zhang D., Zhang J.  ACM Transactions on Knowledge Discovery from Data (TKDD) 5(1): 1-44, 2010. Type: Article The Web contains rich sets of information about researchers in all areas. It would be extremely useful to be able to retrieve an accurate and complete profile of a researcher by simply supplying a name to a search engine. In this paper, Tang et... Apr 6 2011   Efficient algorithms for large-scale local triangle counting Becchetti L., Boldi P., Castillo C., Gionis A.  ACM Transactions on Knowledge Discovery from Data (TKDD) 4(3): 1-28, 2010. Type: Article Becchetti et al. present efficient approximation algorithms that count the number of local triangles in large graphs (both undirected and directed). They suggest possible applications of the counting algorithms for Web spam detection and local... Feb 23 2011   An event-based framework for characterizing the evolutionary behavior of interaction graphs Asur S., Parthasarathy S., Ucar D.  ACM Transactions on Knowledge Discovery from Data (TKDD) 3(4): 1-36, 2009. Type: Article The behavior of interactions can be analyzed with the help of interaction graphs that represent the existence of relationships between entities. Temporal change of relationships is investigated by comparing consecutive snapshots of the graph,... Jun 10 2010   Efficient algorithms for genome-wide association study Zhang X., Zou F., Wang W.  ACM Transactions on Knowledge Discovery from Data (TKDD) 3(4): 1-28, 2009. Type: Article, Reviews: (2 of 2) The convergence, divergence, parallel, and interaction motions by thousands of genes in humans make it difficult to predict the functionality of gene structures. In order to understand the fundamental techniques of multifaceted phenotypes,... Apr 26 2010   Efficient algorithms for genome-wide association study Zhang X., Zou F., Wang W.  ACM Transactions on Knowledge Discovery from Data (TKDD) 3(4): 1-28, 2009. Type: Article, Reviews: (1 of 2) Zhang, Zou, and Wang propose an efficient algorithm to find single-nucleotide polymorphism (SNP) pairs associated with quantitative phenotypes--a process described as association study. A binary representation of all SNPs indicating whether... Mar 19 2010       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc. Terms of Use | Privacy Policy