Faris Alqadah
Faris Alqadah has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Chandan K. Reddy
Virginia Tech, USA
2 shared publications - Hatim F. Alqadah
QM Scientific
1 shared publication Joel S. Bader
1 shared publication- Junling Hu
Samsung Research
1 shared publication - Rajul Anand
Wayne State University
1 shared publication
Latest Publications
- 2 August 2014
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 44 (2) , 475-491
Biclustering neighborhood-based collaborative filtering method for top-n recommender systems
- 2 August 2014
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 44 (2) , 475-491
Biclustering neighborhood-based collaborative filtering method for top-n recommender systems
- 26 April 2012
- Published by Society for Industrial & Applied Mathematics (SIAM)
Query-based Biclustering using Formal Concept Analysis
Biclustering methods have proven to be critical tools in the exploratory analysis of high-dimensional data including information networks, microarray experiments, and bag of words data. However, most biclustering methods fail to answer specific questions of interest and do not incorporate prior knowledge and expertise from the user. To this end, query-based biclustering algorithms that are recently developed in the context of microarray data utilize a set of seed genes provided by the user which are assumed to be tightly co-expressed or functionally related to prune the search space and guide the biclustering algorithm. In this paper, a novel Query-Based Bi-Clustering algorithm, QBBC, is proposed by a new formulation that combines the advantages of low-variance biclustering techniques and Formal Concept Analysis. We prove that statistical dispersion measures that are order-preserving induce an ordering on the set of biclusters in the data. In turn, this ordering is exploited to form query-based biclusters in an efficient manner. Our novel approach provides a mechanism to generalize query-based biclustering to sparse high-dimensional data such as information networks and bag of words. Moreover, the proposed framework performs a local approach to query-based biclustering as opposed to the global approaches that previous algorithms have employed. Experimental results indicate that this local approach often produces higher quality and precise biclusters compared to the state-of-the-art query-based methods. In addition, our results on the performance evaluation illustrate the efficiency and scalability of QBBC compared to full biclustering approaches and other existing query-based approaches.
- 26 April 2012
- Published by Society for Industrial & Applied Mathematics (SIAM)
Query-based Biclustering using Formal Concept Analysis
Biclustering methods have proven to be critical tools in the exploratory analysis of high-dimensional data including information networks, microarray experiments, and bag of words data. However, most biclustering methods fail to answer specific questions of interest and do not incorporate prior knowledge and expertise from the user. To this end, query-based biclustering algorithms that are recently developed in the context of microarray data utilize a set of seed genes provided by the user which are assumed to be tightly co-expressed or functionally related to prune the search space and guide the biclustering algorithm. In this paper, a novel Query-Based Bi-Clustering algorithm, QBBC, is proposed by a new formulation that combines the advantages of low-variance biclustering techniques and Formal Concept Analysis. We prove that statistical dispersion measures that are order-preserving induce an ordering on the set of biclusters in the data. In turn, this ordering is exploited to form query-based biclusters in an efficient manner. Our novel approach provides a mechanism to generalize query-based biclustering to sparse high-dimensional data such as information networks and bag of words. Moreover, the proposed framework performs a local approach to query-based biclustering as opposed to the global approaches that previous algorithms have employed. Experimental results indicate that this local approach often produces higher quality and precise biclusters compared to the state-of-the-art query-based methods. In addition, our results on the performance evaluation illustrate the efficiency and scalability of QBBC compared to full biclustering approaches and other existing query-based approaches.