File Download
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-58149472196
- WOS: WOS:000251611400002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Complex problem solving: Identity matching based on social contextual information
Title | Complex problem solving: Identity matching based on social contextual information |
---|---|
Authors | |
Keywords | Complex problems Design science Identity matching Social contextual information |
Issue Date | 2007 |
Publisher | Association for Information Systems. The Journal's web site is located at http://jais.aisnet.org/ |
Citation | Journal Of The Association Of Information Systems, 2007, v. 8 n. 10, p. article no. 2, 525-545 How to Cite? |
Abstract | Complex problems like drug crimes often involve a large number of variables interacting with each other. A complex problem may be solved by breaking it into parts (i.e., sub-problems), which can be tackled more easily. The identity matching problem, for example, is a part of the problem of drug and other types of crimes. It is often encountered during crime investigations when a single criminal is represented by multiple identity records in law enforcement databases. Because of the discrepancies among these records, a single criminal may appear to be different people. Following Enid Mumford's three-stage problem solving framework, we design a new method to address the problem of criminal identity matching for fighting drug-related crimes. Traditionally, the complexity of criminal identity matching was reduced by treating criminals as isolated individuals who maintain certain personal identities. In this research, we recognize the intrinsic complexity of the problem and treat criminals as interrelated rather than isolated individuals. In other words, we take into consideration of the social relationships between criminals during the matching process. We study not only the personal identities but also the social identities of criminals. Evaluation results were quite encouraging and showed that combining social features with personal features could improve the performance of criminal identity matching. In particular, the social features become more useful when data contain many missing values for personal attributes. Copyright © 2007, by the Association for Information Systems. |
Persistent Identifier | http://hdl.handle.net/10722/85913 |
ISSN | 2023 Impact Factor: 7.0 2023 SCImago Journal Rankings: 2.302 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xu, J | en_HK |
dc.contributor.author | Wang, GA | en_HK |
dc.contributor.author | Li, J | en_HK |
dc.contributor.author | Chau, M | en_HK |
dc.date.accessioned | 2010-09-06T09:10:41Z | - |
dc.date.available | 2010-09-06T09:10:41Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Journal Of The Association Of Information Systems, 2007, v. 8 n. 10, p. article no. 2, 525-545 | en_HK |
dc.identifier.issn | 1536-9323 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/85913 | - |
dc.description.abstract | Complex problems like drug crimes often involve a large number of variables interacting with each other. A complex problem may be solved by breaking it into parts (i.e., sub-problems), which can be tackled more easily. The identity matching problem, for example, is a part of the problem of drug and other types of crimes. It is often encountered during crime investigations when a single criminal is represented by multiple identity records in law enforcement databases. Because of the discrepancies among these records, a single criminal may appear to be different people. Following Enid Mumford's three-stage problem solving framework, we design a new method to address the problem of criminal identity matching for fighting drug-related crimes. Traditionally, the complexity of criminal identity matching was reduced by treating criminals as isolated individuals who maintain certain personal identities. In this research, we recognize the intrinsic complexity of the problem and treat criminals as interrelated rather than isolated individuals. In other words, we take into consideration of the social relationships between criminals during the matching process. We study not only the personal identities but also the social identities of criminals. Evaluation results were quite encouraging and showed that combining social features with personal features could improve the performance of criminal identity matching. In particular, the social features become more useful when data contain many missing values for personal attributes. Copyright © 2007, by the Association for Information Systems. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Association for Information Systems. The Journal's web site is located at http://jais.aisnet.org/ | en_HK |
dc.relation.ispartof | Journal of the Association of Information Systems | en_HK |
dc.subject | Complex problems | en_HK |
dc.subject | Design science | en_HK |
dc.subject | Identity matching | en_HK |
dc.subject | Social contextual information | en_HK |
dc.title | Complex problem solving: Identity matching based on social contextual information | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Chau, M: mchau@hkucc.hku.hk | en_HK |
dc.identifier.authority | Chau, M=rp01051 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-58149472196 | en_HK |
dc.identifier.hkuros | 148562 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-58149472196&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 8 | en_HK |
dc.identifier.issue | 10 | en_HK |
dc.identifier.spage | article no. 2, 525 | en_HK |
dc.identifier.epage | 545 | en_HK |
dc.identifier.isi | WOS:000251611400002 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Xu, J=36006847900 | en_HK |
dc.identifier.scopusauthorid | Wang, GA=7407148134 | en_HK |
dc.identifier.scopusauthorid | Li, J=35205817400 | en_HK |
dc.identifier.scopusauthorid | Chau, M=7006073763 | en_HK |
dc.identifier.issnl | 1536-9323 | - |