Multi-agent self-organizing scheme for chemical patent datamining

E. V. Krishnamurthy

doi:10.1007/978-81-322-0491-6_4

Multi-agent self-organizing scheme for chemical patent datamining

E. V. Krishnamurthy^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We describe a multiagent self-organizing scheme to search for specific structures and substructures, that are included within the generic (Markush) chemical structure expressions in a chemical patent database. This scheme is highly concurrent, since only the local compatibility conditions are checked, by a set of cooperating agents.

Original language	English
Title of host publication	Proceedings of the International Conference on Soft Computing for Problem Solving, SocProS 2011
Pages	41-51
Number of pages	11
Edition	VOL. 2
DOIs	https://doi.org/10.1007/978-81-322-0491-6_4
Publication status	Published - 2012
Event	International Conference on Soft Computing for Problem Solving, SocProS 2011 - Roorkee, India Duration: 20 Dec 2011 → 22 Dec 2011

Publication series

Name	Advances in Intelligent and Soft Computing
Number	VOL. 2
Volume	131 AISC
ISSN (Print)	1867-5662

Conference

Conference	International Conference on Soft Computing for Problem Solving, SocProS 2011
Country/Territory	India
City	Roorkee
Period	20/12/11 → 22/12/11

Access to Document

10.1007/978-81-322-0491-6_4

Cite this

@inproceedings{d9a807ddb6f04a96b2519e84d264e68a,

title = "Multi-agent self-organizing scheme for chemical patent datamining",

abstract = "We describe a multiagent self-organizing scheme to search for specific structures and substructures, that are included within the generic (Markush) chemical structure expressions in a chemical patent database. This scheme is highly concurrent, since only the local compatibility conditions are checked, by a set of cooperating agents.",

keywords = "Agents, Chemical patent data base, Data -mining, Markush structures, Matching substructures, Self organizing scheme",

author = "Krishnamurthy, {E. V.}",

year = "2012",

doi = "10.1007/978-81-322-0491-6_4",

language = "English",

isbn = "9788132204909",

series = "Advances in Intelligent and Soft Computing",

number = "VOL. 2",

pages = "41--51",

booktitle = "Proceedings of the International Conference on Soft Computing for Problem Solving, SocProS 2011",

edition = "VOL. 2",

note = "International Conference on Soft Computing for Problem Solving, SocProS 2011 ; Conference date: 20-12-2011 Through 22-12-2011",

}

Krishnamurthy, EV 2012, Multi-agent self-organizing scheme for chemical patent datamining. in Proceedings of the International Conference on Soft Computing for Problem Solving, SocProS 2011. VOL. 2 edn, Advances in Intelligent and Soft Computing, no. VOL. 2, vol. 131 AISC, pp. 41-51, International Conference on Soft Computing for Problem Solving, SocProS 2011, Roorkee, India, 20/12/11. https://doi.org/10.1007/978-81-322-0491-6_4

Multi-agent self-organizing scheme for chemical patent datamining. / Krishnamurthy, E. V.
Proceedings of the International Conference on Soft Computing for Problem Solving, SocProS 2011. VOL. 2. ed. 2012. p. 41-51 (Advances in Intelligent and Soft Computing; Vol. 131 AISC, No. VOL. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multi-agent self-organizing scheme for chemical patent datamining

AU - Krishnamurthy, E. V.

PY - 2012

Y1 - 2012

N2 - We describe a multiagent self-organizing scheme to search for specific structures and substructures, that are included within the generic (Markush) chemical structure expressions in a chemical patent database. This scheme is highly concurrent, since only the local compatibility conditions are checked, by a set of cooperating agents.

AB - We describe a multiagent self-organizing scheme to search for specific structures and substructures, that are included within the generic (Markush) chemical structure expressions in a chemical patent database. This scheme is highly concurrent, since only the local compatibility conditions are checked, by a set of cooperating agents.

KW - Agents

KW - Chemical patent data base

KW - Data -mining

KW - Markush structures

KW - Matching substructures

KW - Self organizing scheme

UR - http://www.scopus.com/inward/record.url?scp=84861219907&partnerID=8YFLogxK

U2 - 10.1007/978-81-322-0491-6_4

DO - 10.1007/978-81-322-0491-6_4

M3 - Conference contribution

SN - 9788132204909

T3 - Advances in Intelligent and Soft Computing

SP - 41

EP - 51

BT - Proceedings of the International Conference on Soft Computing for Problem Solving, SocProS 2011

T2 - International Conference on Soft Computing for Problem Solving, SocProS 2011

Y2 - 20 December 2011 through 22 December 2011

ER -

Multi-agent self-organizing scheme for chemical patent datamining

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this