Rana Forsati

According to our database1, Rana Forsati authored at least 34 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Efficient fair principal component analysis.
Mach. Learn., 2022

2021
Pareto Efficient Fairness in Supervised Learning: From Extraction to Tracing.
CoRR, 2021

2020
Minimal Variance Sampling with Provable Guarantees for Fast Training of Graph Neural Networks.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2018
A new approach for prediction of collapse settlement of sandy gravel soils.
Eng. Comput., 2018

2017
Learning the Implicit Preference of Users for Effective Recommendation.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

Semi-supervised Collaborative Ranking with Push at the Top.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Cold-Start Recommendation with Provable Guarantees: A Decoupled Approach.
IEEE Trans. Knowl. Data Eng., 2016

Network completion by leveraging similarity of nodes.
Soc. Netw. Anal. Min., 2016

Symbiosis of evolutionary and combinatorial ontology mapping approaches.
Inf. Sci., 2016

2015
Novel harmony search-based algorithms for part-of-speech tagging.
Knowl. Inf. Syst., 2015

An effective Web page recommender using binary data clustering.
Inf. Retr. J., 2015

An improved bee colony optimization algorithm with an application to document clustering.
Neurocomputing, 2015

Weighted bee colony algorithm for discrete optimization problems with application to feature selection.
Eng. Appl. Artif. Intell., 2015

Semi-supervised Collaborative Ranking with Push at Top.
CoRR, 2015

PushTrust: An Efficient Recommendation Algorithm by Leveraging Trust and Distrust Relations.
Proceedings of the 9th ACM Conference on Recommender Systems, 2015

Cold-Start Item and User Recommendation with Decoupled Completion and Transduction.
Proceedings of the 9th ACM Conference on Recommender Systems, 2015

Network Completion with Node Similarity: A Matrix Completion Approach with Provable Guarantees.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Matrix Factorization with Explicit Trust and Distrust Side Information for Improved Social Recommendation.
ACM Trans. Inf. Syst., 2014

Enriched ant colony optimization and its application in feature selection.
Neurocomputing, 2014

Matrix Factorization with Explicit Trust and Distrust Relationships.
CoRR, 2014

2013
A novel efficient algorithm for mobile robot localization.
Robotics Auton. Syst., 2013

Efficient stochastic algorithms for document clustering.
Inf. Sci., 2013

A fuzzy co-clustering approach for hybrid recommender systems.
Int. J. Hybrid Intell. Syst., 2013

2011
A bi-section graph approach for hybrid recommender system.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Heuristic Approach to Solve Feature Selection Problem.
Proceedings of the Digital Information and Communication Technology and Its Applications, 2011

2010
Web Text Mining Using Harmony Search.
Proceedings of the Recent Advances In Harmony Search Algorithm, 2010

Effective page recommendation algorithms based on distributed learning automata and weighted association rules.
Expert Syst. Appl., 2010

A Hybrid Web Recommender System Based on Cellular Learning Automata.
Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

2009
An Agent-based Semantic Web Service Discovery Framework.
Proceedings of the International Conference on Computer Modeling and Simulation, 2009

An efficient algorithm for web recommendation systems.
Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

2008
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing.
Comput. Commun., 2008

Novel meta-heuristic algorithms for clustering web documents.
Appl. Math. Comput., 2008

Hybridization of K-Means and Harmony Search Methods for Web Page Clustering.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication.
Proceedings of the Advances in Computer Science and Engineering, 2008


  Loading...