Saeed Salem - Citegraph

Author Info

Name	Affiliation	Papers
SAEED SALEM	Department of Computer Science, Rensselaer Polytechnic Institute, Troy,	36
Collaborators	Citations	PageRank
75	182	17.39
Referers	Referees	References
480	710	371

Search Limit

100710

Publications (36 rows)

Collaborators (75 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
DL-FHMC: Deep Learning-Based Fine-Grained Hierarchical Learning Approach for Robust Malware Classification	1	0.36	2022
Efficiently mining rich subgraphs from vertex-attributed graphs	0	0.34	2020
On the use of usage patterns from telemetry data for test case prioritization.	1	0.35	2019
A linear delay algorithm for enumerating all connected induced subgraphs.	2	0.38	2019
A Linear Delay Linear Space Algorithm for Enumeration of All Connected Induced Subgraphs.	0	0.34	2018
Classifying Gene Coexpression Networks Using State Subnetworks	0	0.34	2017
Mining Quasi Frequent Coexpression Subnetworks	0	0.34	2017
A Parallel Algorithm For Mining Maximal Frequent Subgraphs	0	0.34	2017
Template Edge Similarity Graph Clustering For Mining Multiple Gene Expression Datasets	1	0.35	2017
A Multithreaded Algorithm for Mining Maximal Cohesive Dense Modules from Interaction Networks with Gene Profiles.	0	0.34	2016
Customized Regression Testing Using Telemetry Usage Patterns	0	0.34	2016
Big data - a 21st century science Maginot Line? No-boundary thinking: shifting from the big data paradigm.	0	0.34	2015
Experience report: Mining test results for reasons other than functional correctness	0	0.34	2015
Mining representative maximal dense cohesive subnetworks	2	0.43	2015
Striving for failure: an industrial case study about test failure prediction	4	0.39	2015
Mining maximal subnetworks from interaction network with node attributes	0	0.34	2015
Discovering dysregulated phenotype-related gene patterns	0	0.34	2014
Improving the effectiveness of test suite through mining historical data	18	0.61	2014
No-boundary thinking in bioinformatics research.	2	0.73	2013
MFMS: maximal frequent module set mining from multiple human gene expression data sets	3	0.38	2013
Discovering maximal cohesive subgraphs and patterns from attributed biological networks	0	0.34	2012
Discovering Communities in Social Networks Using Topology and Attributes	1	0.36	2011
CLARM: an integrative approach for functional modules discovery	0	0.34	2011
Selecting discriminating terms for bug assignment: a formal analysis	9	0.50	2011
SimClus: an effective algorithm for clustering with a lower bound on similarity	13	0.64	2011
Sequential Data Clustering	1	0.35	2010
A formal study of classification techniques on entity discovery and their application to opinion mining	0	0.34	2010
FlexSnap: Flexible Non-sequential Protein Structure Alignment	14	0.74	2010
Robust partitional clustering by outlier and density insensitive seeding	22	0.95	2009
Iterative non-sequential protein structural alignment.	6	0.51	2009
SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters	14	0.70	2009
Clustering with Lower Bound on Similarity	2	0.44	2009
SPARCL: Efficient and Effective Shape-Based Clustering	12	0.92	2008
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns	23	1.09	2008
An integrated, generic approach to pattern mining: data mining template library	17	0.70	2008
Towards generic pattern mining	14	0.79	2005