IP Library › Granted Patent US 12,461,951
Granted Patent B1
US 12,461,951 · App. 18/370,779 · Granted Nov 4, 2025

Parcel growth model training system

Inventors: Kien Trong Trinh (San Diego, CA); Daniel Lawrence Gossett (Round Rock, TX); Charles Presley Reynolds (Austin, TX); Hans Christian Dumke (Lafayette, CO); Bin He (Philadelphia, PA)
Assignee: CoreLogic Solutions, LLC
G06F16/29G06F16/24573
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,461,951
App. No.
18/370,779
Granted
Nov 4, 2025
Kind
B1
Abstract

An improved parcel growth prediction system that uses parcel data, population data, and artificial intelligence to predict the growth of a geographic area at a micro level (e.g., a real estate parcel level) is described herein. For example, the improved parcel growth prediction system may generate a graph model and apply the graph model as an input to an artificial intelligence model to predict the likelihood that a particular parcel may be developed some time in the future. Ultimately, implementing the improved parcel growth prediction system described herein may lead to more precise placements of infrastructure projects and/or to infrastructure projects that more precisely support the needs of the population of a geographic area as time passes.

Claims (48)

1 . A system for training a parcel growth artificial intelligence model, the system comprising:

memory that stores computer-executable instructions; and

a processor in communication with the memory, wherein the computer-executable instructions, when executed by the processor, cause the processor to:

obtain a graph model corresponding to a geographic area, wherein the graph model comprises a first node that corresponds to a first parcel and that is connected to a second node that corresponds to a second parcel;

update a status of the first node to reflect a development status of the first parcel at a first time;

update a status of the second node to reflect a development status of the second parcel at the first time;

train the parcel growth artificial intelligence model using the graph model with the updated status of the first node corresponding to the first time and the updated status of the second node corresponding to the first time;

update a status of the first node to reflect a development status of the first parcel at a second time;

update a status of the second node to reflect a development status of the second parcel at the second time;

apply the graph model with the updated status of the first node corresponding to the second time and the updated status of the second node corresponding to the second time as an input to the trained parcel growth artificial intelligence model to obtain a growth probability; and

validate the trained parcel growth artificial intelligence model based on a comparison of the growth probability with historical data corresponding to a development or lack of development of the first and second parcels by the second time.

2 . The system of claim 1 , wherein the computer-executable instructions, when executed, further cause the processor to:

determine an error rate based on the validation of the trained parcel growth artificial intelligence model; and

re-train the trained parcel growth artificial intelligence model in response to a determination that the error rate exceeds a threshold value.

3 . The system of claim 2 , wherein the computer-executable instructions, when executed, further cause the processor to re-train the trained parcel growth artificial intelligence model using a hyperparameter that is different than a hyperparameter used to train the parcel growth artificial intelligence model.

4 . The system of claim 1 , wherein the development status of the first parcel at the first time comprises one of a developed state, an undeveloped state, or a vacant state.

5 . The system of claim 4 , wherein the undeveloped state is the first parcel has not been developed at least within a threshold time period of the first time.

6 . The system of claim 4 , wherein the developed state is a structure was built on the first parcel at least within a threshold time period of the first time.

7 . The system of claim 1 , wherein the development status of the first parcel at the first time is a developed state, wherein the development status of the second parcel at the first time is a vacant state, wherein the development status of the first parcel at the second time is the developed state, and wherein the development status of the second parcel at the second time is the developed state.

8 . The system of claim 1 , wherein the computer-executable instructions, when executed, further cause the processor to update metadata of the first node to reflect the development status of the first parcel at the first time.

9 . The system of claim 1 , wherein the parcel growth artificial intelligence model comprises a machine learning model.

10 . The system of claim 1 , wherein the second time is after the first time and before a current time.

11 . A computer-implemented method for training a parcel growth artificial intelligence model, the computer-implemented method comprising:

obtaining a graph model corresponding to a geographic area, wherein the graph model comprises a first node that corresponds to a first parcel and that is connected to a second node that corresponds to a second parcel;

updating a status of the first node to reflect a status of the first parcel at a first time;

updating a status of the second node to reflect a status of the second parcel at the first time;

training the parcel growth artificial intelligence model using the graph model with the updated status of the first node corresponding to the first time and the updated status of the second node corresponding to the first time;

updating a status of the first node to reflect a status of the first parcel at a second time;

updating a status of the second node to reflect a status of the second parcel at the second time;

applying the graph model with the updated status of the first node corresponding to the second time and the updated status of the second node corresponding to the second time as an input to the trained parcel growth artificial intelligence model to obtain a growth probability; and

validating the trained parcel growth artificial intelligence model based on a comparison of the growth probability with historical data corresponding to a development or lack of development of the first and second parcels by the second time.

12 . The computer-implemented method of claim 11 , further comprising:

determining an error rate based on the validation of the trained parcel growth artificial intelligence model; and

re-training the trained parcel growth artificial intelligence model in response to a determination that the error rate exceeds a threshold value.

13 . The computer-implemented method of claim 12 , wherein re-training the trained parcel growth artificial intelligence model further comprises re-training the trained parcel growth artificial intelligence model using a hyperparameter that is different than a hyperparameter used to train the parcel growth artificial intelligence model.

14 . The computer-implemented method of claim 11 , wherein the status of the first parcel at the first time comprises one of a developed state, an undeveloped state, or a vacant state.

15 . The computer-implemented method of claim 14 , wherein the developed state is a structure was built on the first parcel at least within a threshold time period of the first time.

16 . The computer-implemented method of claim 11 , wherein updating a status of the first node further comprises updating metadata of the first node to reflect the status of the first parcel at the first time.

17 . A non-transitory, computer-readable medium comprising computer-executable instructions for training a parcel growth artificial intelligence model, wherein the computer-executable instructions, when executed by a computer system, cause the computer system to:

obtain a graph model corresponding to a geographic area, wherein the graph model comprises a first node that corresponds to a first parcel and that is connected to a second node that corresponds to a second parcel;

train the parcel growth artificial intelligence model using the graph model with a status of the first node corresponding to a first time and a status of the second node corresponding to the first time;

apply the graph model with a status of the first node corresponding to a second time and a status of the second node corresponding to the second time as an input to the trained parcel growth artificial intelligence model to obtain a growth probability; and

validate the trained parcel growth artificial intelligence model based on a comparison of the growth probability with historical data corresponding to a development or lack of development of the first and second parcels by the second time.

18 . The non-transitory, computer-readable medium of claim 17 , wherein the computer-executable instructions, when executed, further cause the computer system to:

determine an error rate based on the validation of the trained parcel growth artificial intelligence model; and

re-train the trained parcel growth artificial intelligence model in response to a determination that the error rate exceeds a threshold value.

19 . The non-transitory, computer-readable medium of claim 18 , wherein the computer-executable instructions, when executed, further cause the computer system to re-train the trained parcel growth artificial intelligence model using a hyperparameter that is different than a hyperparameter used to train the parcel growth artificial intelligence model.

20 . The non-transitory, computer-readable medium of claim 17 , wherein the computer-executable instructions, when executed, further cause the computer system to update metadata of the first node to reflect the status of the first parcel at the first time.

Assignments (4)
SECOND LIEN PATENT SECURITY AGREEMENT Recorded Jul 28, 2026
From: CORELOGIC SOLUTIONS, LLC , AS A GRANTOR
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS SECOND LIEN NOTES COLLATERAL AGENT
Reel/Frame 076077/0224 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jul 28, 2026
From: CORELOGIC SOLUTIONS, LLC, AS A GRANTOR
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS FIRST LIEN NOTES COLLATERAL AGENT
Reel/Frame 076077/0305 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jul 28, 2026
From: CORELOGIC SOLUTIONS, LLC, AS GRANTOR
To: JPMORGAN CHASE BANK, N.A., AS FIRST LIEN COLLATERAL AGENT
Reel/Frame 076097/0647 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 13, 2024
From: TRINH, KIEN TRONG; GOSSETT, DANIEL LAWRENCE; REYNOLDS, CHARLES PRESLEY; DUMKE, HANS CHRISTIAN; HE, BIN
To: CORELOGIC SOLUTIONS, LLC
Reel/Frame 068587/0283 →
Continuity (1)
Provisional Application 63409141 · Sep 22, 2022
References Cited (72)
US 5193185A · Lanter · 1993 [cited by examiner]
US 5857174A · Dugan · 1999 [cited by applicant]
US 7890509B1 · Pearcy et al. · 2011 [cited by applicant]
US 8732219B1 · Ferries et al. · 2014 [cited by applicant]
US 10248731B1 · Brouwer et al. · 2019 [cited by applicant]
US 10303816B2 · Nakazawa · 2019 [cited by applicant]
US 10496678B1 · Tang · 2019 [cited by applicant]
US 10521943B1 · Phillips et al. · 2019 [cited by applicant]
US 10726509B1 · Cannon et al. · 2020 [cited by applicant]
US 11301774B2 · Garcia Duran et al. · 2022 [cited by applicant]
US 11373233B2 · Pande et al. · 2022 [cited by applicant]
US 11373257B1 · Guo et al. · 2022 [cited by applicant]
US 11657633B1 · Vandivere · 2023 [cited by examiner]
US 11971263B1 · Malshe et al. · 2024 [cited by applicant]
US 20030158668A1 · Anderson · 2003 [cited by applicant]
US 20030158801A1 · Chuah · 2003 [cited by applicant]
US 20050288957A1 · Eraker et al. · 2005 [cited by applicant]
US 20090132469A1 · White et al. · 2009 [cited by applicant]
US 20130328882A1 · Pirwani et al. · 2013 [cited by applicant]
US 20140365470A1 · Diamond et al. · 2014 [cited by applicant]
US 20150120455A1 · McDevitt et al. · 2015 [cited by applicant]
US 20150186951A1 · Wilson · 2015 [cited by examiner]
US 20150213160A1 · Bright et al. · 2015 [cited by applicant]
US 20160259841A1 · Andrew · 2016 [cited by examiner]
US 20160299639A1 · Adams et al. · 2016 [cited by applicant]
US 20160379388A1 · Rasco · 2016 [cited by examiner]
US 20170287080A1 · Aruswamy et al. · 2017 [cited by applicant]
US 20170316324A1 · Barrett · 2017 [cited by examiner]
US 20180121577A1 · Taylor et al. · 2018 [cited by applicant]
US 20180158158A1 · Coogan-Pushner · 2018 [cited by applicant]
US 20190050491A1 · Mask et al. · 2019 [cited by applicant]
US 20190272669A1 · Esposito · 2019 [cited by examiner]
US 20200380086A1 · Ivanov et al. · 2020 [cited by applicant]
US 20200402116A1 · Avrahami et al. · 2020 [cited by applicant]
US 20210019325A1 · Edge et al. · 2021 [cited by applicant]
US 20210037394A1 · Wainer et al. · 2021 [cited by applicant]
US 20210325891A1 · Young · 2021 [cited by examiner]
US 20220084079A1 · Stewart · 2022 [cited by applicant]
US 20220180169A1 · Gore et al. · 2022 [cited by applicant]
US 20220222758A1 · Beckman · 2022 [cited by applicant]
US 20220292543A1 · Henderson · 2022 [cited by examiner]
US 20220327643A1 · Law et al. · 2022 [cited by applicant]
US 20220335307A1 · Wang et al. · 2022 [cited by applicant]
US 20220383417A1 · Cummings · 2022 [cited by examiner]
US 20230029218A1 · Bhamidipaty et al. · 2023 [cited by applicant]
US 20230119132A1 · Cebulski et al. · 2023 [cited by applicant]
US 20230153931A1 · Lee · 2023 [cited by applicant]
US 20240273637A1 · Gibson et al. · 2024 [cited by applicant]
US 20240394813A1 · Trinh et al. · 2024 [cited by applicant]
US 20250200618A1 · Trinh et al. · 2025 [cited by applicant]
CA 3165715A1 · 2021 [cited by examiner]
CN 101419623 · 2010 [cited by applicant]
CN 113627977A · 2021 [cited by applicant]
CN 115018215 · 2022 [cited by applicant]
CN 115271825A · 2022 [cited by applicant]
WO 2023141579A1 · 2023 [cited by applicant]
WO 2024249178A1 · 2024 [cited by applicant]
WO 2025136982A1 · 2025 [cited by applicant]
“Knowledge graph embedding,” Wikipedia, Oct. 25, 2023, 9 pages. URL: https://en.wikipedia.org/w/index.php? title=Knowledge_graph_embedding&oldid=1181784194. [cited by applicant]
Han, S., et al., “Improving Real Estate Appraisal with POI Integration and Areal Embedding,” arXiv.org, Artificial Intelligence (cs.AI), Nov. 20, 2023, 13 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US24/030350, mailed Oct. 16, 2024. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US24/060576, mailed Feb. 12, 2025. [cited by applicant]
Li, C.C., et al., “Look Around! A Neighbor Relation Graph Learning Framework for Real Estate Appraisal,” arXiv.org, Machine Learning (cs.LG), Dec. 23, 2022, 10 pages. [cited by applicant]
Lin, S. “Home Embeddings for Similar Home Recommendations,” Zillow, Oct. 17, 2018 (accessed May 21, 2024), 11 pages. URL: https://www.zillow.com/tech/embedding-similar-home-recommendation/. [cited by applicant]
Rao, B., et al., “An approach to merging of two community subgraphs to form a community graph using graph mining techniques,” IEEE International Conference on Computational Intelligence and Computing Research, Dec. 18, … [cited by applicant]
Trawinski, B., et al., “Comparison of expert algorithms with machine learning models for real estate appraisal”, 2017 IEEE International Conference on Innovations in Intelligent Systems and Applications (INISTA), 2017, … [cited by applicant]
Wu, P., et al., “Urban parcel grouping method based on urban form and functional connectivity characterisation,” International Journal of Geo-Information, Jun. 2019, vol. 8, 27 pages. [cited by applicant]
Yang, A., et al., “Graph Convolutional Network-Based Model for Megacity Real Estate Valuation,” IEEE Access, vol. 10, Sep. 2022, pp. 104811-104828. [cited by applicant]
Ye, X., et al., “Automating land parcel classification for neighborhood-scale urban analysis,” International Journal of Digital Earth, 2019, vol. 12, pp. 1396-1405. [cited by applicant]
Yu, Y., et al., “Research on real estate pricing methods based on data mining and machine learning”, Neural Computing & Applications, 2021, vol. 33, pp. 3925-3937. [cited by applicant]
Zhang, W., et al., “MugRep: A Multi-Task Hierarchical Graph Representation Learning Framework for Real Estate Appraisal”, Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (KDD '21), 202… [cited by applicant]
Zhang, W., et al., “MugRep: A Multi-Task Hierarchical Graph Representation Learning Framework for Real Estate Appraisal,” arXiv.org, Machine Learning (cs.LG), Aug. 2, 2021, 11 pages. [cited by applicant]
Cited By (1)
US 12,632,910