Kazumi Saito
Biographic Data
| ID | 3925202 |
|---|---|
| NAME | Kazumi Saito |
| GIVEN NAMES | Kazumi |
| FAMILY NAME | Saito |
| SIGNATURE | SAITO K |
| AFFILIATIONS | Kanagawa University |
| ORCID | 0000-0002-8972-5002 |
| VERIFIED | Yes |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 3 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2012 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 0 |
Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition
General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment
Quality of Internet information related to the Mediterranean diet
Objective The present study aimed to evaluate the quality of Internet information on the Mediterranean diet and to determine the relationship between the quality of information and the website source. Design Website sources were categorized as institutional, pharmaceutical, non-pharmaceutical commercial, charitable, support and alternative medicine. Content quality was evaluated using the DISCERN rating instrument, the Health On the Net Foundatio…
No prominent works on this page.
Quality of Internet information related to the Mediterranean diet
Objective The present study aimed to evaluate the quality of Internet information on the Mediterranean diet and to determine the relationship between the quality of information and the website source. Design Website sources were categorized as institutional, pharmaceutical, non-pharmaceutical commercial, charitable, support and alternative medicine. Content quality was evaluated using the DISCERN rating instrument, the Health On the Net Foundatio…
General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment
Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition
Computer Science (3 works) · Complex Network Analysis Techniques (2 works) · Algorithm (1 work) · Bioinformatics and Genomic Networks (1 work) · Bounded function (1 work) · Computation (1 work) · Engineering (1 work) · Family medicine (1 work) · Graph theory and applications (1 work) · Health Literacy and Information Accessibility (1 work)