Home › Researcher directory › Pawan J. Lingras
Pawan J. Lingras
Affiliation : Saint Mary's University
- 25Publications (affiliation in Canada)
- 226Total publications
- 4274Citations
- 35h-index
Research profile
Pawan J. Lingras has 25 indexed publications (2009–2026). Their work appears mainly in “Lecture notes in computer science”, “Communications in computer and information science” and “Fuzzy Sets and Systems”. Their most cited article, “Classification systems based on rough sets under the belief function framework” (2011), has been cited 35 times. 2 of these publications date from the last three years of activity. Their work is co-authored with at least 1 researcher, including institutions in Tunisia.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Rough Sets and Fuzzy Logic
- Advanced Clustering Algorithms Research
- Data Mining and Machine Learning Applications
- Fuzzy and Soft Set Theory
- Data Mining Algorithms and Applications
Publications (25)
- A Possibilistic K-Modes Approach for Incremental Object Integration
- A Possibilistic K-Modes Framework for Decremental Object Processing
- Meta-clustering of possibilistically segmented retail datasets
- Semantically Segmented Clustering Based on Possibilistic and Rough Set Theories
- Decremental Rough Possibilistic K-Modes
- Rough possibilistic meta-clustering of retail datasets
- Semantically Enhanced Clustering in Retail Using Possibilistic K-Modes
- Meta-clustering approach using possibilistic membership: Application to retail datasets
- Iterative meta-clustering through granular hierarchy of supermarket customers and products
- Incremental Rough Possibilistic K-Modes
- The K-Modes Method under Possibilistic Framework
- The k-modes method using possibility and rough set theories
- Incremental Possibilistic K-Modes
- Belief Discernibility Matrix and Function for Incremental or Large Data
- Exhaustive Search with Belief Discernibility Matrix and Function
- RPKM: The Rough Possibilistic K-Modes
- K-Modes Clustering Using Possibilistic Membership
- Heuristic for Attribute Selection Using Belief Discernibility Matrix
- Classification systems based on rough sets under the belief function framework
- Classification with Dynamic Reducts and Belief Functions
- Rule Discovery Process Based on Rough Sets under the Belief Function Framework
- A Comparison of Dynamic and Static Belief Rough Set Classifier
- Belief Rough Set Classification for web mining based on dynamic core
- Belief Rough Set Classifier
- Dynamic Reduct from Partially Uncertain Data Using Rough Sets
Publication venues
- Lecture notes in computer science × 15
- Communications in computer and information science × 2
- Fuzzy Sets and Systems × 1
- International Journal of Intelligent Systems × 1
- IEEE International Conference on Data Science and Advanced Analytics (DSAA) × 1
- World Conference on Complex Systems × 1
Publications per year
- 20262
- 20152
- 20144
- 20137
- 20123
- 20112
- 20103
- 20092
Collaborations
Partner institutions : Tunis University · Institut Supérieur de Gestion de Tunis
Co-authors’ countries : Tunisia
Co-authors
Bibliographic data from OpenAlex (open database).
Why choose Dzcademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.