Sciweavers

Share
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
9 years 7 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
9 years 7 months ago
Connecting the dots between news articles
The process of extracting useful knowledge from large datasets has become one of the most pressing problems in today’s society. The problem spans entire sectors, from scientists...
Dafna Shahaf, Carlos Guestrin
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
9 years 7 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
KDD
2010
ACM
182views Data Mining» more  KDD 2010»
9 years 7 months ago
Extracting temporal signatures for comprehending systems biology models
Naren Sundaravaradan, K. S. M. Tozammel Hossain, V...
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
9 years 7 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
9 years 7 months ago
The topic-perspective model for social tagging systems
In this paper, we propose a new probabilistic generative model, called Topic-Perspective Model, for simulating the generation process of social annotations. Different from other g...
Caimei Lu, Xiaohua Hu, Xin Chen, Jung-ran Park, Ti...
KDD
2010
ACM
187views Data Mining» more  KDD 2010»
9 years 7 months ago
Fast nearest-neighbor search in disk-resident graphs
Purnamrita Sarkar, Andrew W. Moore
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
9 years 7 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
9 years 7 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
9 years 7 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
books