{"id":"https://openalex.org/W2170694982","doi":null,"title":"FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs","display_name":"FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs","publication_year":2009,"publication_date":"2009-12-07","ids":{"openalex":"https://openalex.org/W2170694982","mag":"2170694982"},"language":"en","primary_location":{"id":"pmh:oai:works.bepress.com:andrew_mccallum-1137","doi":null,"is_oa":true,"landing_page_url":"https://works.bepress.com/andrew_mccallum/81","pdf_url":"https://works.bepress.com/cgi/viewcontent.cgi?article=1137&context=andrew_mccallum","source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andrew McCallum","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://works.bepress.com/cgi/viewcontent.cgi?article=1137&context=andrew_mccallum","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107835063","display_name":"Andrew McCallum","orcid":"https://orcid.org/0000-0003-2843-6992","observed_orcids":["https://orcid.org/0000-0003-2843-6992"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew McCallum","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108851994","display_name":"Karl Schultz","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karl Schultz","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005779128","display_name":"Sameer Singh","orcid":"https://orcid.org/0000-0003-0621-6323","observed_orcids":["https://orcid.org/0000-0003-0621-6323"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sameer Singh","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-0621-6323","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA#TAB#","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":16.8489,"has_fulltext":true,"cited_by_count":200,"citation_normalized_percentile":{"value":0.99359304,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":"22","issue":null,"first_page":"1249","last_page":"1257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9595000147819519,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9595000147819519,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.03220000118017197,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-programming","display_name":"probabilistic programming","score":0.8180000185966492},{"id":"https://openalex.org/keywords/factor-graphs","display_name":"factor graphs","score":0.9850000143051147},{"id":"https://openalex.org/keywords/relational-model","display_name":"relational model","score":0.5889999866485596},{"id":"https://openalex.org/keywords/undirected-graphical-models","display_name":"undirected graphical models","score":0.8949999809265137},{"id":"https://openalex.org/keywords/markov-logic-networks","display_name":"Markov logic networks","score":0.6990000009536743},{"id":"https://openalex.org/keywords/software-library","display_name":"software library","score":0.453000009059906},{"id":"https://openalex.org/keywords/object-oriented-programming","display_name":"object-oriented programming","score":0.4090000092983246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8075917959213257},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.688018262386322},{"id":"https://openalex.org/C177877439","wikidata":"https://www.wikidata.org/wiki/Q7604413","display_name":"Statistical relational learning","level":3,"score":0.6555763483047485},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.6370036602020264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6099594235420227},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5532981157302856},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4824117422103882},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.47902315855026245},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.47813260555267334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4514707922935486},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.4392063021659851},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.42818811535835266},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4250108301639557},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4151042103767395},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.41446876525878906},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.41383475065231323},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3822680115699768},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2721700072288513},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.26896601915359497},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.2419155240058899}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:works.bepress.com:andrew_mccallum-1137","doi":null,"is_oa":true,"landing_page_url":"https://works.bepress.com/andrew_mccallum/81","pdf_url":"https://works.bepress.com/cgi/viewcontent.cgi?article=1137&context=andrew_mccallum","source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andrew McCallum","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.7761","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.7761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://books.nips.cc/papers/files/nips22/NIPS2009_0857.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.366.9783","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.9783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://maroo.cs.umass.edu/pub/web/getpdf.php?id=906","raw_type":"text"},{"id":"mag:2170694982","doi":null,"is_oa":false,"landing_page_url":"http://people.cs.umass.edu/~sameer/files/factorie-nips09-slide.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null}],"best_oa_location":{"id":"pmh:oai:works.bepress.com:andrew_mccallum-1137","doi":null,"is_oa":true,"landing_page_url":"https://works.bepress.com/andrew_mccallum/81","pdf_url":"https://works.bepress.com/cgi/viewcontent.cgi?article=1137&context=andrew_mccallum","source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andrew McCallum","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3780657347","display_name":"RI-Medium: Collaborative Research: Dynamically-Structured Conditional Random Fields for Complex, Natural Domains","funder_award_id":"0803847","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7704502625","display_name":"ITR:     Unified Graphical Models of Information Extraction and Data Mining with Application to Social Network Analysis","funder_award_id":"0326249","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309370","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10"},{"id":"https://openalex.org/F4320311089","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2170694982.pdf","grobid_xml":"https://content.openalex.org/works/W2170694982.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W32064870","https://openalex.org/W55914417","https://openalex.org/W204009595","https://openalex.org/W1516735103","https://openalex.org/W1531859941","https://openalex.org/W1547546052","https://openalex.org/W1599188306","https://openalex.org/W1608864735","https://openalex.org/W1766290689","https://openalex.org/W1774330103","https://openalex.org/W1890754682","https://openalex.org/W1894162078","https://openalex.org/W1977970897","https://openalex.org/W1987902506","https://openalex.org/W2070301851","https://openalex.org/W2086240273","https://openalex.org/W2090761873","https://openalex.org/W2121123524","https://openalex.org/W2130944959","https://openalex.org/W2147880316","https://openalex.org/W2149612380","https://openalex.org/W2151322733","https://openalex.org/W2152455533","https://openalex.org/W2187534804","https://openalex.org/W2291194480","https://openalex.org/W2962735828"],"related_works":["https://openalex.org/W2293639816","https://openalex.org/W7099731202","https://openalex.org/W2979415102","https://openalex.org/W7099734428","https://openalex.org/W2399773278","https://openalex.org/W2287975650","https://openalex.org/W2011528978","https://openalex.org/W2736500994","https://openalex.org/W7062426466","https://openalex.org/W3094588386"],"abstract_inverted_index":{"Discriminatively":[0],"trained":[1],"undirected":[2],"graphical":[3],"models":[4,30],"have":[5,116],"had":[6],"wide":[7],"empirical":[8],"success,":[9],"and":[10,36,50,79,97,106,110,148],"there":[11],"has":[12],"been":[13],"increasing":[14],"interest":[15],"in":[16,28,32,47,123],"toolkits":[17],"that":[18],"ease":[19],"their":[20,33,95],"application":[21],"to":[22,43,71,103,141,154],"complex":[23],"relational":[24,29],"data.":[25],"The":[26],"power":[27],"is":[31,41],"repeated":[34],"structure":[35],"tied":[37],"parameters;":[38],"at":[39],"issue":[40],"how":[42],"define":[44],"these":[45],"structures":[46],"a":[48,56,124,129,164],"powerful":[49],"flexible":[51],"way.":[52],"Rather":[53],"than":[54],"using":[55,67],"declarative":[57,105],"language,":[58],"such":[59,118],"as":[60],"SQL":[61],"or":[62],"first-order":[63],"logic,":[64],"we":[65,99,126,150],"advocate":[66],"an":[68,133],"imperative":[69,92],"language":[70],"express":[72],"various":[73],"aspects":[74],"of":[75,88,94,167],"model":[76],"structure,":[77],"inference,":[78],"learning.":[80],"By":[81],"combining":[82],"the":[83,101,168],"traditional,":[84],"declarative,":[85],"statistical":[86],"semantics":[87],"factor":[89,121],"graphs":[90,122],"with":[91],"definitions":[93],"construction":[96],"operation,":[98],"allow":[100],"user":[102],"mix":[104],"procedural":[107],"domain":[108],"knowledge,":[109],"also":[111],"gain":[112],"significant":[113],"efficiencies.":[114],"We":[115],"implemented":[117],"imperatively":[119],"defined":[120],"system":[125],"call":[127],"FACTORIE,":[128],"software":[130],"library":[131],"for":[132],"object-oriented,":[134],"strongly-typed,":[135],"functional":[136],"language.":[137],"In":[138],"experimental":[139],"comparisons":[140],"Markov":[142],"Logic":[143],"Networks":[144],"on":[145],"joint":[146],"segmentation":[147],"coreference,":[149],"find":[151],"our":[152],"approach":[153],"be":[155],"3-15":[156],"times":[157],"faster":[158],"while":[159],"reducing":[160],"error":[161],"by":[162],"20-25%\u2014achieving":[163],"new":[165],"state":[166],"art.":[169],"1":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":23},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":23}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}