House Price Prediction 3 47
House Price Prediction 3 47
List of Figures iv
List of Tables v
1 INTRODUCTION 1
1.1 CONTEXT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 MOTIVATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 OBJECTIVES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 LITERATURE SURVEY 4
2.0.1 BLOCK DIAGRAM . . . . . . . . . . . . . . . . . . . . . . 5
3 METHODOLOGY 7
3.1 ALGORITHM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
4 DESIGN 8
4.1 DATA COLLECTION :- . . . . . . . . . . . . . . . . . . . . . . . . 8
4.2 CLASSIFICATION :- . . . . . . . . . . . . . . . . . . . . . . . . . . 8
4.3 FLOW CHART . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
5 IMPLEMENTATION 10
6 TESTING 11
8 CONCLUSION 13
9 REFERANCE 14
10 SAMPLE CODE 15
11 SCREENSHOTS 33
12 TABLES 40
iii
List of Figures
4.1 Flowchart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
iv
List of Tables
v
Chapter 1
INTRODUCTION
1.1 CONTEXT
This project was made because we were intrigued and we wanted to gain
hands-on experience with the Machine Learning Project.House price prediction
can help the developer determine the selling price of a house and can help the
customer to arrange the right time to purchase a house. There are three factors
that influence the price of a house which include physical conditions, concept and
location.House price prediction works as it take data from the user and process it
and classify it using pre-available data and uses various classification algorithm
and classifies data and predict the accurate price of the property. It then
confirms that accurate prediction result also depends on the population and
quality of the training dataset.In this way, people could make better decisions
when it comes to home investment.The family purchase the house in city. They
invest whole profit into house they don’t have idea about that price of house at
the certain area. So, sometimes they give extra money to builder for same
construction and some distance. But they don’t know about the two different
prices of the model. In some cases,builder can’t predict the price of the current
area where his construction is working so that he can loss his business.
So,proposed system is developing for price
1
College Of Engineering Poonjar HOUSE PRICE PREDICTION
1.2 MOTIVATION
Growing unaffordability of housing has become one of the major challenges for
metropolitan cities around the world. In order to gain a better understanding of
the commercialized housing market we are currently facing, we want to figure out
what are the top influential factors of the housing price. Apart from the more
obvious driving forces such as the inflation and the scarcity of land, there are
also a number of variables that are worth looking into. Therefore, we choose to
study the house prices predicting problem on Kaggle, which enables us to dig
into the variables in depth and to provide a model that could more accurately
estimate home prices. prediction.
Our object is to discuss the major factors that affect housing price and make
precise predictions for it. We use 79 explanatory variables including almost every
aspect of residential homes in bangalore. Methods of both statistical regression
models and machine learning regression models are applied and further compared
according to their performance to better estimate the final price of each house.
The model provides price prediction based on similar comparables of people’s
dream houses, which allows both buyers and sellers to better negotiate home
prices according to market trend. of patients within a reasonable time frame.
The intentions of the system are to reduce over-time pay and increase the
number of patients that can be treated accurately. The relationship between
house prices and the economy is an important motivating factor for predicting
house prices. Housing price trends are not only the concern of buyers and sellers,
but it also indicates the current economic situation.
1.3 OBJECTIVES
As a first project, we intended to make it as instructional as possible by tackling
each stage of the machine learning process and attempting to comprehend it well.
We have picked Bangalore Real Estate Prediction as a method, which is known
as a ”toy issue,” identifying problems that are not of immediate scientific
relevance but are helpful to demonstrate and practice. The objective was to
forecast the price of a specific apartment based on market pricing while
accounting for various ”features” that would be established in the following
sections. To predict the house price according to the area.
* calculate house price depending upon surrounding environment like railway
station, hospital area, ATM, college, banks so customer can purchase flat with
full facilities.
*To suggest builder price prediction for the new constructions.
* provide comparison of house pricing to customers. This paper consists of V
section, section I represents introduction of proposed system and techniques
used. Reviews related previous work in part II. Section III consists of the system
that we proposed to predict house prices. Section IV is about conclusion and the
last section V consists of the future work where, with reference to this system
new modules can be formed.
LITERATURE SURVEY
Real Estate Property is not only a person’s primary desire, but it also reflects a
person’s wealth and prestige in today’s society. Real estate investment typically
appears to be lucrative since property values do not drop in a choppy fashion.
Changes in the value of the real estate will have an impact on many home
investors, bankers, policymakers, and others. Real estate investing appears to be
a tempting option for investors. As a result, anticipating the important estate
price is an essential economic indicator. According to the 2011 census, the Asian
country ranks second in the world in terms of the number of households, with a
total of 24.67 crores. However, previous recessions have demonstrated that real
estate costs cannot be seen. The expenses of significant estate property are
linked to the state’s economic situation. Regardless, we don’t have accurate
standardized approaches to live the significant estate property values. First, we
looked at different articles and discussions about machine learning for housing
price prediction. The title of the article is house price prediction, and it is based
on machine learning and neural networks. The publication’s description is
minimal error and the highest accuracy. The aforementioned title of the paper is
Hedonic models based on price data from Belfast infer that submarkets and
residential valuation this model is used to identify over a larger spatial scale and
implications for the evaluation process related to the selection of comparable
evidence and the quality of variables that the values may require. Understanding
current developments in house prices and homeownership are the subject of the
study. In this article, they utilized a feedback mechanism or social pandemic that
fosters a perception of property as an essential market investment
4
College Of Engineering Poonjar HOUSE PRICE PREDICTION
METHODOLOGY
3.1 ALGORITHM
1) LINEAR REGRESSION: Simple linear regression statistical method allows us
to summarize and study the relationship between two continuous quantative
variables.
*One variable, denoted x, is regarded as the predictor, explanatory, or
independent variable.
*he other variable, denoted y, is regarded as the responsIt is an object that trains
a tree-structured model to predict data in the future in order to provide
meaningful continuous output.
2) DECISION TREE REGRESSION ALGORITHM: core principles of decision
trees, Maximizing Information Gain, Classification trees, and Regression trees
are the processes involved in decision tree regression. The essential notion of
decision trees is that they are built via recursive partitioning. Each node can be
divided into child nodes, beginning with the root node, which is known as the
parent node. These nodes have the potential to become the parent nodes of their
resulting offspring nodes. The nodes at the informative features are specified as
the maximizing information gain, to establish an objective function that is to
optimize the tree learning method.ie, outcome, or dependent variable.
7
Chapter 4
DESIGN
4.2 CLASSIFICATION :-
Classification trees are used to forecast the object into classes of a categorical
dependent variable based on one or more predictor variables.
8
College Of Engineering Poonjar HOUSE PRICE PREDICTION
IMPLEMENTATION
10
Chapter 6
TESTING
The testing would be carried out on the Hospital Management System while
logging into the system as a customer or a normal user of the system.
The Unit Testing is a test that tests each single module of the software to check
for errors. This is mainly done to discover errors in the code of the Hospital
Management System. The main goal of the unit testing would be to isolate each
part of the program and to check the correctness of the code. In the case of
Hospital Management System, all the web forms and the classes will be tested.
In Integration Testing, the individual software modules are combined and tested
as a whole unit. The integration testing generally follows unit testing where each
module is tested as a separate unit. The main purpose of the integration testing
is to test the functional and performance requirements on the major items of the
project.
Acceptance testing is generally performed when the project is nearing its end.
This test mainly qualifies the project and decides if it will be accepted by the
users of the system. The users or the customers of the project are responsible for
the test.
The system testing is mainly done on the whole integrated system to make sure
that the project that has been developed meets all the requirements.
11
Chapter 7
12
Chapter 8
CONCLUSION
We have managed out how to prepare a model that gives users for a novel best
approach with take a gander at future lodging value predictions.Conclusion
College of Engineering Poonjar Conclusion We have used machine learning
algorithms to predict the house prices We have mentioned the step by step
procedure to analyze the dataset and finding the correlation between the
parameters. A few relapse strategies have been investigated Furthermore
compared, when arriving during a prediction strategy In linear regression.
Straight former imply works bring been utilized within our model, something like
that that future value predictions will have a tendency towards All the more
sensible values. These incorporate upgrades we didn’t settle on because of
constrained duration of the time. Moreover, our data set takes more than one
day should prepare. As opposed performing the computations sequentially, we
might utilize various processors and parallel the computations involved, which
might possibly decrease the preparation time Furthermore prediction period.
13
Chapter 9
REFERANCE
14
Chapter 10
SAMPLE CODE
MACHINE LEARNING
15
College Of Engineering Poonjar HOUSE PRICE PREDICTION
i f l e n ( t o k e n s ) == 2 :
return ( f l o a t ( t o k e n s [ 0 ] ) + f l o a t ( t o k e n s [ 1 ] ) ) / 2
try :
return f l o a t ( x )
except :
return None
d f 4 = d f 3 . copy ( )
d f 4 . t o t a l s q f t = d f 4 . t o t a l s q f t . apply ( c o n v e r t s q f t t o n u m )
df4 = df4 [ df4 . t o t a l s q f t . notnull ( ) ]
d f 4 . head ( 2 )
df4 . l o c [ 3 0 ]
(2100+2850)/2
d f 5 = d f 4 . copy ( )
df5 [ ’ p r i c e p e r s q f t ’ ] = df5 [ ’ p r i c e ’ ]∗100000/ df5 [ ’ t o t a l s q f t ’ ]
d f 5 . head ( )
d f 5 s t a t s = df5 [ ’ p r i c e p e r s q f t ’ ] . d e s c r i b e ()
df5 stats
d f 5 . t o c s v ( ”bhp . c s v ” , i n d e x=F a l s e )
d f 5 . l o c a t i o n = d f 5 . l o c a t i o n . apply ( lambda x : x . s t r i p ( ) )
l o c a t i o n s t a t s = d f 5 [ ’ l o c a t i o n ’ ] . v a l u e c o u n t s ( a s c e n d i n g=F a l s e )
location stats
l o c a t i o n s t a t s . v a l u e s . sum ( )
l e n ( l o c a t i o n s t a t s [ l o c a t i o n s t a t s >10])
len ( location stats )
l e n ( l o c a t i o n s t a t s [ l o c a t i o n s t a t s <=10])
l o c a t i o n s t a t s l e s s t h a n 1 0 = l o c a t i o n s t a t s [ l o c a t i o n s t a t s <=10]
location stats less than 10
l e n ( d f 5 . l o c a t i o n . unique ( ) )
d f 5 . l o c a t i o n = d f 5 . l o c a t i o n . apply ( lambda x : ’ o t h e r ’ i f x i n l o c a t i o n s t a
l e n ( d f 5 . l o c a t i o n . unique ( ) )
d f 5 . head ( 1 0 )
d f 5 [ d f 5 . t o t a l s q f t / d f 5 . bhk < 3 0 0 ] . head ( )
d f 5 . shape
d f 6 = d f 5 [ ˜ ( d f 5 . t o t a l s q f t / d f 5 . bhk <300)]
d f 6 . shape
df6 . p r i c e p e r s q f t . d e s c r i b e ()
def remove pps outliers ( df ) :
d f o u t = pd . DataFrame ( )
for key , s u b d f i n d f . groupby ( ’ l o c a t i o n ’ ) :
m = np . mean ( s u b d f . p r i c e p e r s q f t )
s t = np . s t d ( s u b d f . p r i c e p e r s q f t )
r e d u c e d d f = s u b d f [ ( s u b d f . p r i c e p e r s q f t >(m−s t ) ) & ( s u b d f . p r i c e p
d f o u t = pd . c o n c a t ( [ d f o u t , r e d u c e d d f ] , i g n o r e i n d e x=True )
return d f o u t
df7 = remove pps outliers ( df6 )
d f 7 . shape
d e f p l o t s c a t t e r c h a r t ( df , l o c a t i o n ) :
bhk2 = d f [ ( d f . l o c a t i o n==l o c a t i o n ) & ( d f . bhk==2)]
bhk3 = d f [ ( d f . l o c a t i o n==l o c a t i o n ) & ( d f . bhk==3)]
m a t p l o t l i b . rcParams [ ’ f i g u r e . f i g s i z e ’ ] = ( 1 5 , 1 0 )
p l t . s c a t t e r ( bhk2 . t o t a l s q f t , bhk2 . p r i c e , c o l o r= ’ b l u e ’ , l a b e l= ’ 2 BHK ’ , s
p l t . s c a t t e r ( bhk3 . t o t a l s q f t , bhk3 . p r i c e , marker= ’+ ’ , c o l o r= ’ g r e e n ’ , l a b
p l t . x l a b e l ( ” Total Square Feet Area ” )
p l t . y l a b e l ( ” P r i c e ( Lakh I n d i a n Rupees ) ” )
plt . t i t l e ( location )
plt . legend ()
p l o t s c a t t e r c h a r t ( df7 , ” R a j a j i Nagar ” )
p l o t s c a t t e r c h a r t ( df7 , ” Hebbal ” )
def remove bhk outliers ( df ) :
e x c l u d e i n d i c e s = np . a r r a y ( [ ] )
for l o c a t i o n , l o c a t i o n d f i n d f . groupby ( ’ l o c a t i o n ’ ) :
b h k s t a t s = {}
for bhk , b h k d f i n l o c a t i o n d f . groupby ( ’ bhk ’ ) :
b h k s t a t s [ bhk ] = {
’ mean ’ : np . mean ( b h k d f . p r i c e p e r s q f t ) ,
’ s t d ’ : np . s t d ( b h k d f . p r i c e p e r s q f t ) ,
’ count ’ : b h k d f . shape [ 0 ]
}
for bhk , b h k d f i n l o c a t i o n d f . groupby ( ’ bhk ’ ) :
s t a t s = b h k s t a t s . g e t ( bhk−1)
y . head ( 3 )
len
from s k l e a r n . m o d e l s e l e c t i o n import t r a i n t e s t s p l i t
X t r a i n , X t e s t , y t r a i n , y t e s t = t r a i n t e s t s p l i t (X, y , t e s t s i z e =0.2 , r a n
from s k l e a r n . l i n e a r m o d e l import L i n e a r R e g r e s s i o n
l r c l f = LinearRegression ()
l r c l f . f i t ( X train , y t r a i n )
l r c l f . score ( X test , y t e s t )
from s k l e a r n . m o d e l s e l e c t i o n import S h u f f l e S p l i t
from s k l e a r n . m o d e l s e l e c t i o n import c r o s s v a l s c o r e
c r o s s v a l s c o r e ( L i n e a r R e g r e s s i o n ( ) , X, y , cv=cv )
from s k l e a r n . m o d e l s e l e c t i o n import GridSearchCV
d e f f i n d b e s t m o d e l u s i n g g r i d s e a r c h c v (X, y ) :
algos = {
’ linear regression ’ : {
’ model ’ : L i n e a r R e g r e s s i o n ( ) ,
’ params ’ : {
’ n o r m a l i z e ’ : [ True , F a l s e ]
}
},
’ lasso ’ : {
’ model ’ : Lasso ( ) ,
’ params ’ : {
’ alpha ’ : [ 1 , 2 ] ,
’ s e l e c t i o n ’ : [ ’ random ’ , ’ c y c l i c ’ ]
}
},
’ decision tree ’ : {
’ model ’ : D e c i s i o n T r e e R e g r e s s o r ( ) ,
’ params ’ : {
’ c r i t e r i o n ’ : [ ’ mse ’ , ’ friedman mse ’ ] ,
’ s p l i t t e r ’ : [ ’ b e s t ’ , ’ random ’ ]
}
}
}
scores = [ ]
cv = S h u f f l e S p l i t ( n s p l i t s =5, t e s t s i z e =0.2 , r a n d o m s t a t e =0)
for algo name , c o n f i g i n a l g o s . i t e m s ( ) :
gs = GridSearchCV ( c o n f i g [ ’ model ’ ] , c o n f i g [ ’ params ’ ] , cv=cv , r e t
gs . f i t (X, y )
s c o r e s . append ({
’ model ’ : algo name ,
’ b e s t s c o r e ’ : gs . b e s t s c o r e ,
’ b e s t p a r a m s ’ : gs . b e s t p a r a m s
})
f i n d b e s t m o d e l u s i n g g r i d s e a r c h c v (X, y )
d e f p r e d i c t p r i c e ( l o c a t i o n , s q f t , bath , bhk ) :
l o c i n d e x = np . where (X. columns==l o c a t i o n ) [ 0 ] [ 0 ]
x = np . z e r o s ( l e n (X. columns ) )
x [0] = sqft
x [ 1 ] = bath
x [ 2 ] = bhk
i f l o c i n d e x >= 0 :
x [ loc index ] = 1
return l r c l f . p r e d i c t ( [ x ] ) [ 0 ]
import p i c k l e
with open ( ’ b a n g l o r e h o m e p r i c e s m o d e l . p i c k l e ’ , ’wb ’ ) as f :
p i c k l e . dump( l r c l f , f )
import j s o n
columns = {
’ da ta c ol umn s ’ : [ c o l . l o w e r ( ) for c o l i n X. columns ]
}
with open ( ” columns . j s o n ” , ”w” ) as f :
f . w r i t e ( j s o n . dumps ( columns ) )
BACK END
{SERVER PAGE}
from f l a s k import F l a s k , r e q u e s t , u r l f o r , j s o n i f y , r e n d e r t e m p l a t e
import u t i l
app = F l a s k ( name )
@app . r o u t e ( ’ / ’ )
def i n d e x ( ) :
return r e n d e r t e m p l a t e ( ’ i n d e x . html ’ )
@app . r o u t e ( ’ / about ’ )
def about ( ) :
return r e n d e r t e m p l a t e ( ’ about . html ’ )
@app . r o u t e ( ’ / dashboard ’ )
def dashboard ( ) :
u t i l . g e t e s t i m a t e d p r i c e ( l o c a t i o n , t o t a l s q f t , bhk , bath )
})
r e s p o n s e . h e a d e r s . add ( ’ Access−Control −Allow−O r i g i n ’ , ’ ∗ ’ )
return r e s p o n s e
if name == ’ main ’:
app . run ( debug=True )
UTILITY / CONNECTION
import j s o n
import p i c k l e
import numpy as np
l o c a t i o n s = None
d a t a c o l u m n s = None
m o d e l = None
def g e t l o c a t i o n n a m e s ( ) :
return locations
def g e t e s t i m a t e d p r i c e ( l o c a t i o n , s q f t , bhk , bath ) :
try :
loc index = data columns . index ( l o c a t i o n . lower ( ) )
except :
l o c i n d e x = −1
x = np . z e r o s ( len ( data columns ))
x [0] = sqft
x [ 1 ] = bath
x [ 2 ] = bhk
i f l o c i n d e x >= 0 :
x [ loc index ] = 1
return round ( model . p r e d i c t ( [ x ] ) [ 0 ] , 2 )
def l o a d s a v e d a r t i f a c t s ( ) :
print ( ” Loding saved a r t i f a c t s . . . . start ”)
global data columns
global locations
with open ( ” a r t i f a c t s / columns . j s o n ” , ’ r ’ ) as f :
d a t a c o l u m n s = j s o n . l o a d ( f ) [ ’ d at a co lu mn s ’ ]
locations = data columns [ 3 : ]
global model
with open ( ” a r t i f a c t s / b a n g l o r e h o m e p r i c e s m o d e l 2 . p k l ” , ’ rb ’ )
as f :
model = p i c k l e . load ( f )
print ( ’ Loading saved a r t i f a c t s . . . . . done ’ )
if name == ’ main ’:
load saved artifacts ()
print ( g e t l o c a t i o n n a m e s ( ) )
#t e s t i n g
print ( g e t e s t i m a t e d p r i c e ( ’ 1 s t Phase JP Nagar ’ , 1 0 0 0 , 3 , 3 ) )
print ( g e t e s t i m a t e d p r i c e ( ’ 1 s t Phase JP Nagar ’ , 1 0 0 0 , 2 , 2 ) )
print ( g e t e s t i m a t e d p r i c e ( ’ K a l h a l l i ’ , 1 0 0 0 , 2 , 2 ) )
print ( g e t e s t i m a t e d p r i c e ( ’ E j i p u r a ’ , 1 0 0 0 , 2 , 2 ) )
DYNAMIC WEB CONNECTIVITY
f u n c t i o n getBathValue ( ) {
var uiBathrooms = document . getElementsByName ( ” uiBathrooms ” ) ;
for ( var i in uiBathrooms ) {
i f ( uiBathrooms [ i ] . checked ) {
return p a r s e I n t ( i )+1;
}
}
return −1; // I n v a l i d Value
}
f u n c t i o n getBHKValue ( ) {
var uiBHK = document . getElementsByName ( ”uiBHK” ) ;
for ( var i in uiBHK) {
i f (uiBHK [ i ] . checked ) {
return p a r s e I n t ( i )+1;
}
}
return −1; // I n v a l i d Value
}
function onClickedEstimatePrice () {
c o n s o l e . l o g ( ” Estimate p r i c e button c l i c k e d ” ) ;
v a l u e=”2” checked/>
<l a b e l for=” r a d i o −bhk−2”>2</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bhk−3” name=”uiBHK”
v a l u e=”3”/>
<l a b e l for=” r a d i o −bhk−3”>3</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bhk−4” name=”uiBHK”
v a l u e=”4”/>
<l a b e l for=” r a d i o −bhk−4”>4</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bhk−5” name=”uiBHK”
v a l u e=”5”/>
<l a b e l for=” r a d i o −bhk−5”>5</ l a b e l >
</div>
<h2>Bath</h2>
<d i v c l a s s=” switch −f i e l d ”>
<input type=” r a d i o ” id=” r a d i o −bath −1” name=” uiBathrooms ”
v a l u e=”1”/>
<l a b e l for=” r a d i o −bath −1”>1</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bath −2” name=” uiBathrooms ”
v a l u e=”2” checked/>
<l a b e l for=” r a d i o −bath −2”>2</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bath −3” name=” uiBathrooms ”
v a l u e=”3”/>
<l a b e l for=” r a d i o −bath −3”>3</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bath −4” name=” uiBathrooms ”
v a l u e=”4”/>
<l a b e l for=” r a d i o −bath −4”>4</ l a b e l >
<input type=” r a d i o ” id=” r a d i o −bath −5” name=” uiBathrooms ”
v a l u e=”5”/>
<l a b e l for=” r a d i o −bath −5”>5</ l a b e l >
</div>
<h2>Location </h2>
<div>
< s e l e c t c l a s s=” l o c a t i o n ” name=”” id=” u i L o c a t i o n s ”>
<o p t i o n v a l u e=”” d i s a b l e d=” d i s a b l e d ”
s e l e c t e d=” s e l e c t e d ”>Choose a Location </o pt i on >
padding : 8px 16 px ;
margin−r i g h t : −1px ;
b o r d e r : 1px s o l i d rgba ( 0 , 0 , 0 , 0 . 2 ) ;
box−shadow : i n s e t 0 1px 3px rgba ( 0 , 0 , 0 , 0 . 3 ) , 0 1px
rgba ( 2 5 5 , 2 5 5 , 2 5 5 , 0 . 1 ) ;
t r a n s i t i o n : a l l 0 . 1 s ea s e −in−out ;
}
. s w i t ch −f i e l d l a b e l : hover {
cursor : pointer ;
}
. s w i t ch −f i e l d input : checked + l a b e l {
background−c o l o r : #6C55F9 ;
box−shadow : none ;
c o l o r : white ;
}
. s w i t ch −f i e l d l a b e l : f i r s t −of −type {
border −r a d i u s : 4px 0 0 4px ;
}
. s w i t ch −f i e l d l a b e l : l a s t −of −type {
border −r a d i u s : 0 4px 4px 0 ;
}
. form {
max−width : 270 px ;
f o n t −f a m i l y : ” Lucida Grande ” , Tahoma , Verdana , sans− s e r i f ;
f o n t −weight : normal ;
l i n e −h e i g h t : 1 . 6 2 5 ;
margin : 8px auto ;
padding− l e f t : 50 px ;
padding−r i g h t : ;
padding−top : 10 px ;
padding−bottom : 10 px ;
z−i n d e x : 2 ;
background−c o l o r : rgba ( 0 , 0 , 0 , 0 . 7 ) ;
box−shadow : rgba ( 0 , 0 , 0 , 0 . 5 6 ) 0px 22 px 70 px 4px ;
border −r a d i u s : 4px ;
}
h2 {
f o n t −s i z e : 18 px ;
margin−bottom : 8px ;
c o l o r : white ;
f o n t −f a m i l y : sans− s e r i f ;
}
h1 {
c o l o r : #FFD700 ;
f o n t −f a m i l y : sans− s e r i f ;
f o n t −s i z e : 30 px ;
margin−bottom : 8px ;
}
. area {
f o n t −f a m i l y : ” Roboto ” , sans− s e r i f ;
outline : 0;
ackground : #f 2 f 2 f 2 ;
width : 76%;
border : 0;
margin : 0 0 10 px ;
padding : 10 px ;
box−s i z i n g : border −box ;
f o n t −s i z e : 15 px ;
h e i g h t : 35 px ;
border −r a d i u s : 5px ;
}
. location {
f o n t −f a m i l y : ” Roboto ” , sans− s e r i f ;
outline : 0;
background : #f 2 f 2 f 2 ;
width : 76%;
border : 0;
margin : 0 0 10 px ;
padding : 10 px ;
box−s i z i n g : border −box ;
f o n t −s i z e : 15 px ;
h e i g h t : 40 px ;
border −r a d i u s : 5px ;
}
. submit {
background : #6C55F9 ;
width : 76%;
border : 0;
c o l o r : white ;
margin : 25 px 0 10 px ;
box−s i z i n g : border −box ;
f o n t −s i z e : 15 px ;
h e i g h t : 35 px ;
t e x t −a l i g n : c e n t e r ;
border −r a d i u s : 5px ;
}
. result{
width : 76%;
border : 0;
margin : 25 px 0 10 px ;
box−s i z i n g : border −box ;
f o n t −s i z e : 25 px ;
h e i g h t : 50 px ;
t e x t −a l i g n : c e n t e r ;
}
. img {
background : u r l ( ’ h t t p s : / / images . u n s p l a s h . com/ photo−
1505843513577 −22 bb7d21e455 ? i x l i b=rb−
1 . 2 . 1 & i x i d=MnwxMjA3fDB8MHxwaG90by1wYWdlfHx8fGVufDB8fHx8&auto=forma
t& f i t =crop&w=1632&q=80 ’ ) ;
background−r e p e a t : no−r e p e a t ;
background−s i z e : auto ;
background−s i z e :100% 100%;
position : fixed ;
width : 100%;
h e i g h t : 100%;
top : 0 ;
l e f t : 0;
z−i n d e x : −1;
}
body , html {
h e i g h t : 100%;
}
SCREENSHOTS
33
College Of Engineering Poonjar HOUSE PRICE PREDICTION
TABLES
40