Decisions surrounding adverse drug reaction prescribing : Insights from consumers and implications for decision support
- O'Brien, Michelle, Yearwood, John
- Authors: O'Brien, Michelle , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Research and Practice in Information Technology Vol. 37, no. 1 (2005), p. 57-71
- Full Text:
- Reviewed:
- Description: This paper presents findings from case studies of health consumers who each suspect they may have experienced an adverse drug reaction (ADR). These case studies are part of a larger study involving consumer/doctor decisions surrounding suspected adverse drug reactions and prescribing. Decision support to assist with the diagnosis and management of ADRs has, to date, primarily focused on providing in-time information to prescribers about factors that pertain to the consumer and the medications they are taking. Decision support that includes consumers usually targets treatment decisions. The results of this paper indicate the prescriber is only one decision contributor in a rich tapestry of decision contributors and decision types, and consumer decision types are significantly broader than treatment decisions. The results provide guidance for the development of decision support within this domain.
- Description: C1
- Description: 2003001435
- Authors: O'Brien, Michelle , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Research and Practice in Information Technology Vol. 37, no. 1 (2005), p. 57-71
- Full Text:
- Reviewed:
- Description: This paper presents findings from case studies of health consumers who each suspect they may have experienced an adverse drug reaction (ADR). These case studies are part of a larger study involving consumer/doctor decisions surrounding suspected adverse drug reactions and prescribing. Decision support to assist with the diagnosis and management of ADRs has, to date, primarily focused on providing in-time information to prescribers about factors that pertain to the consumer and the medications they are taking. Decision support that includes consumers usually targets treatment decisions. The results of this paper indicate the prescriber is only one decision contributor in a rich tapestry of decision contributors and decision types, and consumer decision types are significantly broader than treatment decisions. The results provide guidance for the development of decision support within this domain.
- Description: C1
- Description: 2003001435
How to improve postgenomic knowledge discovery using imputation
- Sehgal, Muhammad Shoaib B, Gondal, Iqbal, Dooley, Laurence, Coppel, Ross
- Authors: Sehgal, Muhammad Shoaib B , Gondal, Iqbal , Dooley, Laurence , Coppel, Ross
- Date: 2009
- Type: Text , Journal article
- Relation: Eurasip Journal on Bioinformatics and Systems Biology Vol. 2009, no. 1 (2009), p. 1-14
- Full Text:
- Reviewed:
- Description: While microarrays make it feasible to rapidly investigate many complex biological problems, their multistep fabrication has the proclivity for error at every stage. The standard tactic has been to either ignore or regard erroneous gene readings as missing values, though this assumption can exert a major influence upon postgenomic knowledge discovery methods like gene selection and gene regulatory network (GRN) reconstruction. This has been the catalyst for a raft of new flexible imputation algorithms including local least square impute and the recent heuristic collateral missing value imputation, which exploit the biological transactional behaviour of functionally correlated genes to afford accurate missing value estimation. This paper examines the influence of missing value imputation techniques upon postgenomic knowledge inference methods with results for various algorithms consistently corroborating that instead of ignoring missing values, recycling microarray data by flexible and robust imputation can provide substantial performance benefits for subsequent downstream procedures
- Authors: Sehgal, Muhammad Shoaib B , Gondal, Iqbal , Dooley, Laurence , Coppel, Ross
- Date: 2009
- Type: Text , Journal article
- Relation: Eurasip Journal on Bioinformatics and Systems Biology Vol. 2009, no. 1 (2009), p. 1-14
- Full Text:
- Reviewed:
- Description: While microarrays make it feasible to rapidly investigate many complex biological problems, their multistep fabrication has the proclivity for error at every stage. The standard tactic has been to either ignore or regard erroneous gene readings as missing values, though this assumption can exert a major influence upon postgenomic knowledge discovery methods like gene selection and gene regulatory network (GRN) reconstruction. This has been the catalyst for a raft of new flexible imputation algorithms including local least square impute and the recent heuristic collateral missing value imputation, which exploit the biological transactional behaviour of functionally correlated genes to afford accurate missing value estimation. This paper examines the influence of missing value imputation techniques upon postgenomic knowledge inference methods with results for various algorithms consistently corroborating that instead of ignoring missing values, recycling microarray data by flexible and robust imputation can provide substantial performance benefits for subsequent downstream procedures
Matching algorithms : fundamentals, applications and challenges
- Ren, Jing, Xia, Feng, Chen, Xiangtai, Liu, Jiaying, Sultanova, Nargiz
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
- «
- ‹
- 1
- ›
- »