default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Totohasina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Bruce Masonova Solozafy Bemena
, André Totohasina, Daniel Rajaonasy Feno:
The Effectiveness of the M G K Measure against the Odds Ratio in the Epidemiological Study. Int. J. Math. Math. Sci. 2022: 7835758:1-7835758:12 (2022)- 2021
- [c10]Parfait Bemarisika, André Totohasina:
Generating a Condensed Representation for Positive and Negative Association Rules A Condensed Representation for Association Rules. BIS 2021: 175-186 - 2020
- [c9]Parfait Bemarisika, André Totohasina:
An Efficient Method for Mining Informative Association Rules in Knowledge Extraction. CD-MAKE 2020: 227-247
2010 – 2019
- 2019
- [j2]Armand Armand, André Totohasina, Daniel Rajaonasy Feno:
An Extension of Totohasina's Normalization Theory of Quality Measures of Association Rules. Int. J. Math. Math. Sci. 2019: 7829805:1-7829805:7 (2019) - [c8]Parfait Bemarisika, André Totohasina:
An Informative Base of Positive and Negative Association Rules on Big Data. IEEE BigData 2019: 2428-2437 - [c7]Hery Frédéric Rakotomalala, André Totohasina:
On Hierarchical Classification Implicative and Cohesive M_GKMGK-Based: Application on Analysis of the Computing Curricula and Students Abilities According the Anglo-Saxon Model. ICICT (1) 2019: 83-90 - [c6]Parfait Bemarisika, André Totohasina:
Elimination of Redundant Association Rules. ISAT (2) 2019: 208-218 - 2018
- [j1]Armand Armand, André Totohasina, Daniel Rajaonasy Feno:
Toward a Theory of Normalizing Function of Interestingness Measure of Binary Association Rules. Int. J. Math. Math. Sci. 2018: 4814716:1-4814716:8 (2018) - [c5]Parfait Bemarisika, Harrimann Ramanantsoa, André Totohasina:
An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data. CD-MAKE 2018: 79-97 - [c4]Parfait Bemarisika, André Totohasina:
ERAPN, an Algorithm for Extraction Positive and Negative Association Rules in Big Data. DaWaK 2018: 329-344 - 2017
- [c3]Parfait Bemarisika, André Totohasina:
Optimized Mining of Potential Positive and Negative Association Rules. DaWaK 2017: 424-432
2000 – 2009
- 2007
- [p1]Jean Diatta, Henri Ralambondrainy, André Totohasina:
Towards a Unifying Probabilistic Implicative Normalized Quality Measure for Association Rules. Quality Measures in Data Mining 2007: 237-250 - 2006
- [c2]Jean Diatta, Daniel Rajaonasy Feno, André Totohasina:
Galois Lattices and Bases for MGK-Valid Association Rules. CLA 2006: 186-197 - 2005
- [c1]André Totohasina, Henri Ralambondrainy:
ION: a pertinent new measure for mining information from many types of data. SITIS 2005: 202-207
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
